An exponential improvement for diagonal Ramsey

Marcelo Campos, Simon Griffiths, Robert Morris +1

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…