Regular spanning 2-factor decomposition conjecture
Regular spanning 2-factor decomposition conjecture
Let be an -vertex -regular graph with even , and let be a -regular graph on vertices. Regular spanning 2-factor decomposition conjecture. The graph decomposes into copies of . The statement is proposed as an asymptotic transfer of the minimum-degree triangle decomposition conjecture to arbitrary spanning -regular graphs; the supplied source gives no resolution evidence.
Sources & referencesView supporting material
Primary source
Stefan Glock, Felix Joos, Jaehoon Kim, Daniela Kühn and Deryk Osthus, “Resolution of the Oberwolfach problem”, arXiv:1806.04644 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.