HackerPapers

arXiv:2507.12926math.CO

An exponential improvement for Ramsey lower bounds

Jie Ma, Wujie Shen, Shengjie Xie

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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ős in 1947.

arXiv comments
44 pages, 3 figures
Journal reference
DOI
Subjects
math.COCombinatorics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jul 2025 to Jul 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.