An exponential improvement for Ramsey lower bounds
Abstract
We prove a new lower bound on the Ramsey number r(, C) for any constant C > 1 and sufficiently large , showing that there exists =(C)> 0 such that \[ r(, C) ≥ (pC-1/2 + ), \] where pC ∈ (0, 1/2) is the unique solution to C = pC(1 - pC). This provides the first exponential improvement over the classical lower bound obtained by Erdos in 1947.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.