An exponential improvement for Ramsey lower bounds
Combinatorics
2026-04-28 v2
Abstract
We prove a new lower bound on the Ramsey number for any constant and sufficiently large , showing that there exists such that where is the unique solution to . 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