Optimizing the CGMS upper bound on Ramsey numbers
Optimizing the CGMS upper bound on Ramsey numbers
In a recent breakthrough Campos, Griffiths, Morris and Sahasrabudhe obtained the first exponential improvement of the upper bound on the diagonal Ramsey numbers since 1935. We shorten their proof, replacing the underlying book algorithm with a simple inductive statement. This modification allows us - to give a very short proof …