The equipartite Oberwolfach problem with uniform tables (Q1865407): Difference between revisions

Let \(K(m:n)\) be the complete \(n\)-partite graph with \(m\) vertices in each partite set. Let \(G\) and \(H\) be graphs. An \(H\)-factorization of \(G\) is a partition of the edge set \(E(G)\) of \(G\) into subsets that induce spanning subgraphs of \(G\) such that each component of each of the subgraphs is isomorphic to \(H\). It is shown that for \(t\geq 3\) and \(n\geq 2\), \(K(m:n)\) has a \(C_t\)-factorization (where \(C_t\) is a cycle of length \(t\)) if and only if \(mn\) is divisible by \(t\), \(m(n-1)\) is even, \(t\) is even if \(n=2\), and \((m,n,t)\not=(2,3,3),(6,3,3),(2,6,3),(6,2,6)\). This result settles down an important special case of a generalization of the well-known Oberwolfach problem.