Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
arXiv:1501.06999
Abstract
It is conjectured that for every pair of odd integers greater than 2 with , there exists a cyclic two-factorization of having exactly factors of type and all the others of type . The authors prove the conjecture in the affirmative when and .
31 pages