An exponential improvement for diagonal Ramsey

Abstract: The Ramsey number

R (k)

is the minimum

n i n m a t h b b 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

v a r e p s i l o n > 0

. This is the first exponential improvement over the upper bound of ErdH{o}s and Szekeres, proved in 1935.

This page was built for publication: An exponential improvement for diagonal Ramsey