The Hamilton-Waterloo Problem for C₃-factors and C_n-factors

2016/09/02 by Li Wang, Fen Chen, Haitao Cao
Mathematics · #math.CO

paper · pdf

published as Journal of Combinatorial Design 25(2017),385-418 · arXiv admin note: text overlap with arXiv:1605.00818

arxiv created 2016/09/02 · arxiv updated 2017/10/10

Abstract

The Hamilton-Waterloo problem asks for a 2-factorization of K_v (for v odd) or K_v minus a 1-factor (for v even) into C_m-factors and C_n-factors. We completely solve the Hamilton-Waterloo problem in the case of C₃-factors and C_n-factors for n=4,5,7.

Citations

• Further results on the Hamilton-Waterloo problem