English

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 (,m)(\ell,m) of odd integers greater than 2 with m1  (mod)m \equiv 1\; \pmod{\ell}, there exists a cyclic two-factorization of KmK_{\ell m} having exactly (m1)/2(m-1)/2 factors of type m\ell^m and all the others of type mm^{\ell}. The authors prove the conjecture in the affirmative when 1  (mod4)\ell \equiv 1\; \pmod{4} and m2+1m \geq \ell^2 -\ell + 1.

Keywords

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

R2 v1 2026-06-22T08:14:36.396Z