An asymptotic solution to the cycle decomposition problem for complete graphs

DOI10.1016/j.jcta.2010.03.015zbMath1213.05205OpenAlexW1992779658MaRDI QIDQ1957980

Daniel Horsley, Darryn E. Bryant

Publication date: 27 September 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.03.015

zbMATH Keywords

cycle decompositionsgraph decompositions

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Small embeddings for partial 5-cycle systems ⋮ Maximum packings of the complete graph with uniform length cycles ⋮ Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ Neighborhoods in Maximum Packings of 2K_nand Quadratic Leaves of Triple Systems ⋮ Decomposition of a complete bipartite multigraph into arbitrary cycle sizes ⋮ Decomposing various graphs into short even-length cycles ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ Cycle decompositions of complete multigraphs ⋮ Decomposing complete equipartite graphs into short even cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• On Alspach's conjecture
• Packing cycles in complete graphs
• Packing closed trails into dense graphs.
• Skolem-type difference sets for cycle systems
• On Alspach's conjecture with two even cycle lengths
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• On the Alspach Conjecture
• Packing Circuits into K_N
• Cycle decompositions III: Complete graphs and fixed length cycles
• On certain distributions of integers in pairs with given differences
• Verification of a Conjecture of Th. Skolem.
• Hamilton cycle decomposition of 6-regular circulants of odd order
• Decompositions of complete graphs into long cycles
• Decompositions of complete graphs into triangles and Hamilton cycles

This page was built for publication: An asymptotic solution to the cycle decomposition problem for complete graphs