Recognition: unknown
An exponential improvement for Ramsey lower bounds
read the original abstract
We prove a new lower bound on the Ramsey number $r(\ell, C\ell)$ for any constant $C > 1$ and sufficiently large $\ell$, showing that there exists $\varepsilon=\varepsilon(C)> 0$ such that \[ r(\ell, C\ell) \geq \left(p_C^{-1/2} + \varepsilon\right)^\ell, \] where $p_C \in (0, 1/2)$ is the unique solution to $C = \frac{\log p_C}{\log(1 - p_C)}$. This provides the first exponential improvement over the classical lower bound obtained by Erd\H{o}s in 1947.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
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.
-
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).
-
A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
Zero-sum Ramsey numbers R(G, Γ) satisfy R(G, Γ) ≤ C n for bounded-degree n-vertex graphs G whenever |Γ| divides e(G).
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.