Every triangle-free d-degenerate graph has fractional chromatic number at most (4+o(1))d/ln d, confirming Harris's conjecture.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Triangle-free $d$-degenerate graphs have small fractional chromatic number
Every triangle-free d-degenerate graph has fractional chromatic number at most (4+o(1))d/ln d, confirming Harris's conjecture.