Uncrouded k-uniform hypergraphs attain independence number (1-ε)n ((log Δ)/((k-1)Δ))^{1/(k-1)} for large Δ, matching the shattering threshold.
Toward Vu’s conjecture
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
-
The independence number of uncrowded hypergraphs: bounds matching the shattering threshold
Uncrouded k-uniform hypergraphs attain independence number (1-ε)n ((log Δ)/((k-1)Δ))^{1/(k-1)} for large Δ, matching the shattering threshold.