Regular spanning 2-factor decomposition conjecture

Let GG be an nn-vertex rr-regular graph with even r34n+o(n)r\geq \frac{3}{4}n+o(n), and let FF be a 22-regular graph on nn vertices. Regular spanning 2-factor decomposition conjecture. The graph GG decomposes into copies of FF. The statement is proposed as an asymptotic transfer of the minimum-degree triangle decomposition conjecture to arbitrary spanning 22-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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.