Linear Turán number ex_r^lin(n,T_k^r) is at least n(k-1)/r for any r-uniform tree with k edges; exact upper bound (r+1)n/r for B_4^r with characterization, (2r-1)n/r for E_4^r, and matching lower construction for P_4^r.
Hypergraph turan problems.Surveys in combinatorics, 392:83–140
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
-
Bounds on Linear Tur\'{a}n Number for Trees
Linear Turán number ex_r^lin(n,T_k^r) is at least n(k-1)/r for any r-uniform tree with k edges; exact upper bound (r+1)n/r for B_4^r with characterization, (2r-1)n/r for E_4^r, and matching lower construction for P_4^r.