On the Oberwolfach problem with two similar length cycles (Q5943039): Difference between revisions

An \((m_1,m_2,\dots,m_t)\)-2-factor of a graph is a 2-factor consisting of cycles of lengths \(m_1,\dots,m_t\) and an \((m_1,m_2,\dots,m_t)\)-2-factorization of a graph \(G\) is a partition of the edge set of \(G\) into \((m_1,m_2,\dots,m_t)\)-2-factors. Suppose \(n=m_1+m_2+\dots +m_t\). The problem of determining whether there exists an \((m_1,m_2,\dots,m_t)\)-2-factorization of \(K_n\) (the complete graph on \(n\) vertices) when \(n\) is odd, or \(K_n-F\) (the complete graph on \(n\) vertices with a 1-factor \(F\) removed) when \(n\) is even, is the Oberwolfach problem. In this paper, the author solves the Oberwolfach problem for all \(m\geq 3\) for the case where the 2-factors consist of two cycles of lengths \(m\) and \(m+1\), and for the case where the 2-factors consist of two cycles of lengths \(m\) and \(m+2\).