Gaussian random graphs and Ramsey numbers
Combinatorics
2026-05-19 v2
Abstract
We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction based on Gaussian random graphs, which allows us to simplify their analysis significantly. As a consequence of this simpler analysis, we also obtain better quantitative bounds.
Cite
@article{arxiv.2512.17718,
title = {Gaussian random graphs and Ramsey numbers},
author = {Zach Hunter and Aleksa Milojević and Benny Sudakov},
journal= {arXiv preprint arXiv:2512.17718},
year = {2026}
}
Comments
17 pages