Proves f_{F,G}(n) ≤ C (log n)^{β_F} for r-uniform hypergraphs under the stated conditions on F and G, sharpening prior bounds and confirming a conjecture for r=3.
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
-
Generalized Erd\H{o}s--Rogers problems for $r$-uniform hypergraphs
Proves f_{F,G}(n) ≤ C (log n)^{β_F} for r-uniform hypergraphs under the stated conditions on F and G, sharpening prior bounds and confirming a conjecture for r=3.