Large forbidden trade volumes and edge packings of random graphs Original Research Article

Let G be a graph. A G-trade of volume m is a pair image, where each of image and image consists of m graphs, pairwise edge-disjoint, isomorphic to G, such that image and the union of the edge sets of the graphs in image is identical to the union of the edge sets of the graphs in image. Let image be the set of non-negative integers m such that no G-trade of volume m exists. In this paper we prove that, for image image holds asymptotically almost surely, where image.