r_4(5,n) is at least 2^{2^{c n^{1/7}}}, determining the tower growth rate of r_k(k+1,n) for hypergraph Ramsey numbers.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper proves existence of strong Boolean Ramsey numbers R^#_k,t(B|Q) for any finite poset Q and gives probabilistic upper bounds plus combinatorial lower bounds on the strong Erdős-Gyárfás function f_t^#(n,p,q).
citing papers explorer
-
A double-exponential lower bound for $r_4(5,n)$
r_4(5,n) is at least 2^{2^{c n^{1/7}}}, determining the tower growth rate of r_k(k+1,n) for hypergraph Ramsey numbers.
-
Erd\H{o}s-Gy\'{a}rf\'{a}s problem for partially ordered sets
The paper proves existence of strong Boolean Ramsey numbers R^#_k,t(B|Q) for any finite poset Q and gives probabilistic upper bounds plus combinatorial lower bounds on the strong Erdős-Gyárfás function f_t^#(n,p,q).