A Generalization of the Hamilton-Waterloo Problem on Complete Equipartite Graphs

Melissa Keranen, Adrián Pastine

The Hamilton-Waterloo problem asks for which $s$ and $r$ the complete graph $K_n$ can be decomposed into $s$ copies of a given 2-factor $F_1$ and $r$ copies of a given 2-factor $F_…