Garaschuk's conjecture on fractional triangle decompositions

About 11 years old · traced to

Let GG be a graph with nn vertices and minimum degree at least 34n\frac{3}{4}n. Garaschuk's conjecture. If nn is large enough, then GG is fractionally K3K_3-decomposable. Fractional triangle decomposability is a relaxation of an actual triangle decomposition, and this conjecture would provide the fractional decomposition threshold needed in approaches to Nash-Williams' conjecture. The source presents it as a conjecture and identifies Garaschuk's result as the best known result towards Nash-Williams' conjecture, so its resolution status should be checked against the cited work.

References

Primary source

François Dross, “Fractional triangle decompositions in graphs with large minimum degree”, arXiv:1503.08191 (2015).

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.