An exponential improvement for diagonal Ramsey

Abstract: The Ramsey number $R(k)$ is the minimum $n \in \mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that [ R(k) \leqslant (4 - \varepsilon)^k ] for some constant $\varepsilon > 0$. This is the first exponential improvement over the upper bound of Erd\H{o}s and Szekeres, proved in 1935.

• The paper presents an exponential improvement by refining the classical upper bound from 4^k to (4 - ε)^k for diagonal Ramsey numbers.
• It introduces the 'Book Algorithm' that employs innovative combinatorial methods and density-boost steps to construct large monochromatic books.
• The approach extends to off-diagonal Ramsey numbers, offering significant exponential improvements and inspiring further research in graph theory.

An Exponential Improvement for Diagonal Ramsey

The paper "An exponential improvement for diagonal Ramsey" by Marcelo Campos, Simon Griffiths, Robert Morris, and Julian Sahasrabudhe presents a significant advancement in the field of combinatorics, particularly in the study of Ramsey numbers. The Ramsey number $R(k)$ is the smallest integer $n$ such that every red-blue coloring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic $K_k$. This paper addresses one of the long-standing problems in Ramsey theory: improving the upper bound on diagonal Ramsey numbers beyond the traditional bound set by Erdős and Szekeres in 1935, which is $R(k) \leq 4^k$.

Key Contributions

1. Exponential Improvement: The authors introduce a new upper bound $R(k) \leq (4 - \epsilon)^k$ for some constant $\epsilon > 0$. This represents the first exponential improvement over the classical bound established nearly a century ago.
2. New Approaches: The methodology to achieve this improvement involves novel combinatorial techniques that diverge from the traditional quasirandomness methods used by Thomason, Conlon, and Sah in recent advancements. Particularly, the concept of "books" (graphs with specific connectivities) plays a pivotal role in this new approach.
3. Algorithmic Framework: The paper introduces the "Book Algorithm," which systematically constructs large monochromatic books in graph colorings lacking large monochromatic cliques, thereby facilitating the determination of an improved Ramsey upper bound.
4. Off-diagonal Ramsey Numbers: The techniques proposed not only apply to diagonal Ramsey numbers but also provide exponential bounds for off-diagonal Ramsey numbers, $R(k, \ell)$, especially when $\ell = \Theta(k)$.
5. Iterative Density-Boost Steps: A crucial innovation in the algorithm involves density-boost steps, which enhance the red density between node sets more effectively than previous techniques in combinatorial optimization.

Numerical and Theoretical Claims

The paper provides explicit bounds and definitions for new parameters linked to the book algorithm to control steps of density regulations effectively. The Ramsey numbers $R(k, \ell)$ are shown to be improved by exponential factors, particularly illustrating that for $\ell = \Theta(k)$, the factors are substantial compared to known bounds.

Implications and Future Directions

This work underscores a breakthrough in Ramsey theory by not only advancing the theoretical understanding of Ramsey numbers but also introducing computational techniques that could inspire further research in related graph problems. The constructive method introduced suggests potential applications beyond pure mathematics, possibly influencing fields requiring graph colorings or network connectivities.

The combination of exploiting combinatorial structures such as "books" and the efficiency of density boosts offers a fertile ground for future research. Areas of potential expansion include optimizing the constants $\epsilon$ further and exploring connections between Ramsey theory and quasirandom properties of different graph classes.

Conclusion

While the paper's results do not claim to have solved the generalized Ramsey conjecture, they mark a milestone by exceeding barriers long thought insurmountable in combinatorics. The novel approach, supported by strong numerical results and practical implications, significantly contributes to the ongoing quest for understanding Ramsey numbers and their broad applications in mathematical sciences. The work stands as a testament to how classic problems in mathematics can witness profound evolutions through dedicated and innovative research methodologies.