Maximum packings of the complete graph with uniform length cycles

DOI10.1002/jgt.20536zbMath1234.05188OpenAlexW2077942532MaRDI QIDQ3174232

Daniel Horsley

Publication date: 12 October 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20536

zbMATH Keywords

cyclesmaximum packings

Mathematics Subject Classification ID

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

Related Items (5)

Decomposing various graphs into short even-length cycles ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ Six-cycle systems ⋮ Cycle packings of the complete multigraph ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Packing cycles in complete graphs
• Packing pentagons into complete graphs: How clumsy can you get?
• Maximum packings with odd cycles
• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• An asymptotic solution to the cycle decomposition problem for complete graphs
• On the Alspach Conjecture
• Cycle decompositions III: Complete graphs and fixed length cycles
• Decompositions of complete graphs into long cycles
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Cycle decompositions of complete multigraphs

This page was built for publication: Maximum packings of the complete graph with uniform length cycles