Published July 28, 2008
| public
Journal Article
More on decompositions of edge-colored complete graphs
Abstract
Let g be a family of graphs whose edges are colored with elements from a set R of r colors. We assume no two vertices of G are joined by more than one edge of color i for any i ∈ R, for each G ∈ g. K^((r))_n will denote the complete graph with r edges joining any pair of distinct vertices, one of each of the r colors. We describe necessary and asymptotically sufficient conditions on n for the existence of a family D of subgraphs of K^((r))_n, each of which is an isomorphic copy of some graph in g, so that each edge of K^((r))_n appears in exactly one of the subgraphs in D.
Additional Information
© 2008 Elsevier. Received 30 August 2004; accepted 9 August 2007. Available online 3 December 2007. Research supported by JSPS Research Fellow 09978. Research supported by NSA Grant H98230-04-1-0037.Additional details
- Eprint ID
- 19084
- Resolver ID
- CaltechAUTHORS:20100715-120722042
- Japan Society for the Promotion of Science (JSPS)
- 09978
- National Security Agency
- H98230-04-1-0037
- Created
-
2010-08-05Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field