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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
math.CO 3years
2026 3verdicts
UNVERDICTED 3roles
background 2polarities
background 2representative citing papers
f^{(4)}_{5^{-},6}(N) equals (log log N) to the Theta(1) power, with improved lower bounds r_4(6,n) >= 2^{2^{c sqrt(n)}} and r_k(k+2,n).
The paper establishes the improved lower bound r_4(5,n) >= 2^{2^{Omega(n^{1/5})}} for the 4-uniform 5-clique Ramsey number by reducing greedy local-maxima selection from seven layers to five in a modified construction.
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.
-
A Note on Generalized Erd\H{o}s-Rogers Problems
f^{(4)}_{5^{-},6}(N) equals (log log N) to the Theta(1) power, with improved lower bounds r_4(6,n) >= 2^{2^{c sqrt(n)}} and r_k(k+2,n).
-
An improved double-exponential lower bound for $r_4(5,n)$
The paper establishes the improved lower bound r_4(5,n) >= 2^{2^{Omega(n^{1/5})}} for the 4-uniform 5-clique Ramsey number by reducing greedy local-maxima selection from seven layers to five in a modified construction.