The generalized almost resolvable cycle system problem

DOI10.1007/s00493-010-2525-zzbMath1240.05239OpenAlexW2083380281MaRDI QIDQ653836

D. G. Hoffman, Elizabeth J. Billington, Peter J. Adams, Charles C. Lindner

Publication date: 19 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-010-2525-z

zbMATH Keywords

almost resolvable cycle systemalmost parallel classshort parallel class

Mathematics Subject Classification ID

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

Related Items (4)

Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)

Cites Work

• Unnamed Item
• Hanani triple systems
• The solution of the bipartite analogue of the Oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions III: Complete graphs and fixed length cycles
• Almost resolvable cycle systems-an analogue of Hanani triple systems

This page was built for publication: The generalized almost resolvable cycle system problem