Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
Abstract
It is conjectured that for every pair (,m) of odd integers greater than 2 with m 1\; , there exists a cyclic two-factorization of K m having exactly (m-1)/2 factors of type m and all the others of type m. The authors prove the conjecture in the affirmative when 1\; 4 and m ≥ 2 - + 1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.