Almost resolvable cycle systems-an analogue of Hanani triple systems

DOI10.1002/jcd.20204zbMath1227.05082OpenAlexW2018363124MaRDI QIDQ3578149

Mariusz Meszka, Alexander Rosa, Charles C. Lindner

Publication date: 13 July 2010

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20204

zbMATH Keywords

smallest orderalmost resolvable 2k-cycle systems

Mathematics Subject Classification ID

Triple systems (05B07)

Related Items (7)

Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ The generalized almost resolvable cycle system problem ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ More results on cycle frames and almost resolvable cycle systems ⋮ Six-cycle systems

Cites Work

• Unnamed Item
• Hanani triple systems
• The solution of the bipartite analogue of the Oberwolfach problem
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• The Oberwolfach problem and factors of uniform odd length cycles

This page was built for publication: Almost resolvable cycle systems-an analogue of Hanani triple systems