An asymptotic solution to the cycle decomposition problem for complete graphs

DOI10.1016/J.JCTA.2010.03.015MaRDI QIDQ1957980zbMATH OpenOpenAlexFDO

Authors Daniel Horsley, Darryn 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)

Recommendations

• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• scientific article; zbMATH DE number 786153
• Decomposing the complete graph into cycles of many lengths
• On Complete (s,t)-Cycle Systems of Complete Graphs
• Cycle decompositions of complete graphs

Cites work

• Cycle decompositions of K_n and K_n-I
• Cycle decompositions of complete graphs
• Cycle decompositions of the complete graph.
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Decompositions of complete graphs into long cycles
• Decompositions of complete graphs into triangles and Hamilton cycles
• Hamilton cycle decomposition of 6-regular circulants of odd order
• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• On Alspach's conjecture
• On Alspach's conjecture with two even cycle lengths
• On certain distributions of integers in pairs with given differences
• On the Alspach conjecture
• Packing circuits into K_N.
• Packing closed trails into dense graphs.
• Packing cycles in complete graphs
• Skolem-type difference sets for cycle systems
• Some results on decompositions of low degree circulant graphs
• Verification of a Conjecture of Th. Skolem.

Cited in

(18)

• Cyclically decomposing the complete graph into cycles
• Decomposing the complete graph into cycles of many lengths
• Decomposing various graphs into short even-length cycles
• Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths
• Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
• Small embeddings for partial 5-cycle systems
• Neighborhoods in maximum packings of 2K_n and quadratic leaves of triple systems
• Decomposing complete equipartite graphs into short even cycles
• Maximum packings of the complete graph with uniform length cycles
• Face 2-Colorable Embeddings with Faces of Specified Lengths
• scientific article; zbMATH DE number 786153 (Why is no real title available?)
• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• scientific article; zbMATH DE number 2202148 (Why is no real title available?)
• Cycle decompositions of complete multigraphs
• A generalization of the problem of Mariusz Meszka
• Decompositions of complete multigraphs into cycles of varying lengths
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Decompositions of complete graphs into blown-up cycles \(C_m\)[2]

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1957980)