More on decompositions of edge-colored complete graphs

DOI10.1016/j.disc.2007.08.044zbMath1143.05064OpenAlexW1971367333MaRDI QIDQ924985

Richard M. Wilson, Anna Draganova, Yukiyasu Mutoh

Publication date: 29 May 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.044

zbMATH Keywords

decompositioncomplete graphedge-colored

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items

A lower bound on HMOLS with equal sized holes ⋮ On perfect Γ-decompositions of the complete graph ⋮ Local balance in graph decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Decompositions of edge-colored complete graphs
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• {2, 3}‐perfect m‐cycle systems are equationally defined for m = 5, 7, 8, 9, and 11 only