Improved fractional chromatic number bounds for d-degenerate locally r-colorable graphs as O(d log(2r)/log d) and for girth-4 r-uniform hypergraphs as c_r (d/log d)^{1/(r-1)} via entropy methods.
Coloring graphs with forbidden almost bipartite subgraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fractional coloring via entropy
Improved fractional chromatic number bounds for d-degenerate locally r-colorable graphs as O(d log(2r)/log d) and for girth-4 r-uniform hypergraphs as c_r (d/log d)^{1/(r-1)} via entropy methods.