Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
Combinatorics
2016-04-01 v2
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 .
Cite
@article{arxiv.1501.06999,
title = {Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles},
author = {Francesca Merola and Tommaso Traetta},
journal= {arXiv preprint arXiv:1501.06999},
year = {2016}
}
Comments
31 pages