Every graph on n vertices with minimum degree at least ((7+sqrt(21))/14)n admits a fractional triangle decomposition, improving prior bounds.
Dross, Fractional triangle decompositions in graphs with large minimum degree, SIAM Journal on Discrete Mathematics , 30(1), 2015, 36–42
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Progress towards Nash-Williams' Conjecture on Triangle Decompositions
Every graph on n vertices with minimum degree at least ((7+sqrt(21))/14)n admits a fractional triangle decomposition, improving prior bounds.