Further results on the Hamilton-Waterloo problem

2016/05/03 by L. Wang, S. Lu, H. Cao · 2 citations
Mathematics · #math.CO

paper · pdf · doi:10.1002/jcd.21571

arxiv created 2016/05/03 · arxiv updated 2017/10/10

Abstract

In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the Hamilton-Waterloo problem.

Cited by

• Almost resolvable k-cycle systems with k≡ 2\pmod 4
• The Hamilton-Waterloo Problem for C₃-factors and C_n-factors

Related

• The Hamilton-Waterloo Problem with C₄ and C_m Factors
• The Hamilton-Waterloo Problem with even cycle lengths
• Completing the spectrum of almost resolvable cycle systems with odd cycle length
• Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
• On the Hamilton-Waterloo Problem with cycle lengths of distinct parities