Alspach's conjecture
Alspach's conjecture is a mathematical theorem that characterizes the disjoint cycle covers of complete graphs with prescribed cycle lengths. It is named after Brian Alspach, who posed it as a research problem in 1981. A proof was published by Darryn Bryant, Daniel Horsley, and William Pettersson (2014).
Formulation
In this context, a disjoint cycle cover is a set of simple cycles, no two of which use the same edge, that include all of the edges of a graph. For a disjoint cycle cover to exist, it is necessary for every vertex to have even degree, because the degree of each vertex is two times the number of cycles that include that vertex, an even number. And for the cycles in a disjoint cycle cover to have a given collection of lengths, it is also necessary for the sum of the given cycle lengths to equal the total number of edges in the given graph. Alspach conjectured that, for complete graphs, these two necessary conditions are also sufficient: if [math]\displaystyle{ n }[/math] is odd (so that the degrees are even) and a given list of cycle lengths (all at most [math]\displaystyle{ n }[/math]) adds to [math]\displaystyle{ \tbinom{n}{2} }[/math] (the number of edges in the complete graph) then the complete graph [math]\displaystyle{ K_n }[/math] can always be decomposed into cycles of the given length. It is this statement that Bryant, Horsley, and Pettersson proved.
Generalization to even numbers of vertices
For complete graphs [math]\displaystyle{ K_n }[/math] whose number [math]\displaystyle{ n }[/math] of vertices is even, Alspach conjectured that it is always possible to decompose the graph into a perfect matching and a collection of cycles of prescribed lengths summing to [math]\displaystyle{ \tbinom{n}{2}-n/2 }[/math]. In this case the matching eliminates the odd degree at each vertex, leaving a subgraph of even degree, and the remaining condition is again that the sum of the cycle lengths equals the number of edges to be covered. This variant of the conjecture was also proven by Bryant, Horsley, and Pettersson.
Related problems
The Oberwolfach problem on decompositions of complete graphs into copies of a given 2-regular graph is related, but neither is a special case of the other. If [math]\displaystyle{ G }[/math] is a 2-regular graph, with [math]\displaystyle{ n }[/math] vertices, formed from a disjoint union of cycles of certain lengths, then a solution to the Oberwolfach problem for [math]\displaystyle{ G }[/math] would also provide a decomposition of the complete graph into [math]\displaystyle{ (n-1)/2 }[/math] copies of each of the cycles of [math]\displaystyle{ G }[/math]. However, not every decomposition of [math]\displaystyle{ K_n }[/math] into this many cycles of each size can be grouped into disjoint cycles that form copies of [math]\displaystyle{ G }[/math], and on the other hand not every instance of Alspach's conjecture involves sets of cycles that have [math]\displaystyle{ (n-1)/2 }[/math] copies of each cycle.
References
- "Problem 3", Discrete Mathematics 36 (3): 333, 1981, doi:10.1016/s0012-365x(81)80029-5
- Bryant, Darryn; Horsley, Daniel; Pettersson, William (2014), "Cycle decompositions V: Complete graphs into cycles of arbitrary lengths", Proceedings of the London Mathematical Society, Third Series 108 (5): 1153–1192, doi:10.1112/plms/pdt051
- "Alspach's conjecture", Graphs & Digraphs, Textbooks in Mathematics, 39 (6th ed.), CRC Press, 2015, p. 349, ISBN 9781498735803, https://books.google.com/books?id=Cjw0CwAAQBAJ&pg=PA349
 |  |
