More on decompositions of edge-colored complete graphs Original Research Article

Let image be a family of graphs whose edges are colored with elements from a set image of image colors. We assume no two vertices of image are joined by more than one edge of color image for any image, for each image. image will denote the complete graph with image edges joining any pair of distinct vertices, one of each of the image colors. We describe necessary and asymptotically sufficient conditions on image for the existence of a family image of subgraphs of image, each of which is an isomorphic copy of some graph in image, so that each edge of image appears in exactly one of the subgraphs in image.