Further results on the Hamilton-Waterloo problem
Combinatorics
2017-10-10 v1
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.
Cite
@article{arxiv.1605.00818,
title = {Further results on the Hamilton-Waterloo problem},
author = {L. Wang and S. Lu and H. Cao},
journal= {arXiv preprint arXiv:1605.00818},
year = {2017}
}