On Alspach's conjecture with two even cycle lengths
Alspach's conjecture states that if \(\pi\) is a partition of the number \(v(v-1)/2\), for \(v\) odd [of the number \(v(v-2)/2\), for \(v\) even] into \(s\) parts, each at least 3 and at most \(v\), then there exists a decomposition of the complete graph \(K_v\) [of the cocktail-party graph \(K_v-F\)] into \(s\) cycles whose lengths equal the parts of the partition \(\pi\). In this paper, the authors deal with the case when all parts are equal to one of two even numbers \(m\), \(n\), \(m< n\). They show that in this case Alspach's conjecture is true if and only if it is true for all \(v< 7n\). This, together with settling several small cases, makes it possible to show that the Alspach conjecture is true for all even \(m\), \(n\leq 10\).
- Decomposition of complete graphs into cycles and stars
- An asymptotic solution to the cycle decomposition problem for complete graphs
- On Complete (s,t)-Cycle Systems of Complete Graphs
- \((4, 5)\)-cycle systems of complete multipartite graphs
- On m-cycle holey systems
- Alspach's problem: The case of Hamilton cycles and 5-cycles
- Cycle decompositions of complete multigraphs
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Small cycles and 2-factor passing through any given vertices in graphs
- On Alspach's conjecture
- Packing cycles in complete graphs
This page was built for publication: On Alspach's conjecture with two even cycle lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587593)
