The generalized almost resolvable cycle system problem (Q653836): Difference between revisions

For a \(k\)-cycle system of order \(n\), \(n=kq+r\), \(r<k\), the authors define an almost parallel class to be a collection of \(q=(n-r)/k\) pairwise vertex disjoint \(k\)-cycles, and the \(k\)-cycle system is almost resolvable if it can be partitioned in almost parallel classes such that the remaining \(k\)-cycles are vertex disjoint. It is shown that an almost resolvable 10-cycle system of order \(n\) exists exactly for \(n\equiv 1\) or \(5 \pmod{20}\). The proof is constructive. The construction of almost resolvable \(2k\)-cycle systems of order \(4k+1\) for \(k \geq 4\) is left as an open problem.