For any tree T and family F, ex(n,T,F) is either Ω(n^{k+1}) or O(ex(n,F)^k) for every integer k.
Letzter,Many H-copies in graphs with a forbidden tree, SIAM J
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
-
Helly Theorems for Generalized Tur\'an Problems
For any tree T and family F, ex(n,T,F) is either Ω(n^{k+1}) or O(ex(n,F)^k) for every integer k.