A local averaging argument shows linear r-uniform hypergraphs above a quadratic density threshold contain k edges on at most (r-2)k+3 vertices.
Title resolution pending
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
-
A Simple Counting Argument for Dense Linear Hypergraphs
A local averaging argument shows linear r-uniform hypergraphs above a quadratic density threshold contain k edges on at most (r-2)k+3 vertices.