Online algorithms achieve multiplicative approximation r^{1/(r-1)} for maximum independent sets in dense r-uniform ER hypergraphs and (max γ_i)^{-1/(r-1)} for balanced sets in r-partite versions, with matching lower bounds.
Independent sets and colorings ofK t,t,t-free graphs
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Transfer theorem converts max-degree independence bounds to average-degree bounds for hereditary uniform hypergraphs, with applications to cycle-free graphs and bounded-clique graphs.
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.
citing papers explorer
-
Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
Online algorithms achieve multiplicative approximation r^{1/(r-1)} for maximum independent sets in dense r-uniform ER hypergraphs and (max γ_i)^{-1/(r-1)} for balanced sets in r-partite versions, with matching lower bounds.
-
Hypergraph independence bounds: from maximum degree to average degree
Transfer theorem converts max-degree independence bounds to average-degree bounds for hereditary uniform hypergraphs, with applications to cycle-free graphs and bounded-clique graphs.
-
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.