The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors (Q1876686): Difference between revisions

The Hamilton-Waterloo problem asks for a 2-factorization of the complete graph \(K_{2n+1}\) where \(r\) of the factors are isomorphic to a given 2-factor \(Q\), and \(s\) of the factors are isomorphic to a given 2-factor \(R\). The present paper deals with the version where \(Q\) is a Hamiltonian cycle, and \(R\) is the disjoint union of triangles.