English

An exponential improvement for Ramsey lower bounds

Combinatorics 2026-04-28 v2

Abstract

We prove a new lower bound on the Ramsey number r(,C)r(\ell, C\ell) for any constant C>1C > 1 and sufficiently large \ell, showing that there exists ε=ε(C)>0\varepsilon=\varepsilon(C)> 0 such that r(,C)(pC1/2+ε), r(\ell, C\ell) \geq \left(p_C^{-1/2} + \varepsilon\right)^\ell, where pC(0,1/2)p_C \in (0, 1/2) is the unique solution to C=logpClog(1pC)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.

Keywords

Cite

@article{arxiv.2507.12926,
  title  = {An exponential improvement for Ramsey lower bounds},
  author = {Jie Ma and Wujie Shen and Shengjie Xie},
  journal= {arXiv preprint arXiv:2507.12926},
  year   = {2026}
}

Comments

44 pages, 3 figures

R2 v1 2026-07-01T04:05:43.786Z