An exponential improvement for diagonal RamseyThe Ramsey number R(k) is the minimum n such that every red-blue colouring of the edges of the complete graph on n vertices contains a monochromatic copy of K_k. It has been known since the work of Erdos and Szekeres in 1935, and Erdos in 1947, that 2^{k/2} < R(k) < 4^k, but until recently the only improvements were by lower order terms. In this talk I will give an introduction to the area, and also sketch the proof of a recent result, which improves the upper bound of Erdos and Szekeres by a (small) exponential factor. Based on joint work with Marcelo Campos, Simon Griffiths and Julian Sahasrabudhe.