Garaschuk's conjecture on fractional triangle decompositions
Garaschuk's conjecture on fractional triangle decompositions
Let be a graph with vertices and minimum degree at least . Garaschuk's conjecture. If is large enough, then is fractionally -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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
François Dross, “Fractional triangle decompositions in graphs with large minimum degree”, arXiv:1503.08191 (2015).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.