For nearly ninety years, mathematicians believed that Paul Erdős’s 1935 upper bound for Ramsey numbers was unbeatable; Marcelo Campos and colleagues proved that complete chaos forms orderly patterns at an exponentially faster rate. Awarded the 2024 Michael Brin Prize, this sensational breakthrough delivered the first exponential improvement to diagonal Ramsey bounds since 1935, revolutionizing modern combinatorics.

Ramsey theory asks a fundamental question: how many guests must you invite to a party to guarantee that at least six guests either all know each other or are all total strangers? In 1935, legendary mathematicians Paul Erdős and George Szekeres established a famous mathematical ceiling of 4^k guests.
For eighty-eight years, generations of brilliant mathematicians attempted to improve that 4^k exponential rate without success. The four researchers designed a new graph-hunting algorithm based on "book graphs" that systematically exposes hidden dense structures inside massive networks of connections.
By lowering the base from 4 to 3.993, the team shattered an eight-decade barrier. By providing new tools for network science, by proving that order is mathematically inevitable in large datasets, and by reinvigorating extremal combinatorics, Ramsey exponential bounds made history.
An exponential improvement for Ramsey lower bounds
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ős in 1947.
Ask this paper your own questions, or keep browsing the verified research catalogue.