
Upper Bounds for Multicolour Ramsey Numbers
Marius Tiba, speaking at the Institute for Advanced Study's Computer Science/Discrete Mathematics seminar, presents a new upper bound for the multicolour Ramsey number Rr(k), the smallest n for which every r-colouring of the edges of the complete graph Kn must contain a monochromatic Kk. Tiba shows that for each fixed r at least 2, Rr(k) is bounded above by an exponentially improved expression, the first such improvement over the 1935 bound of Erdos and Szekeres for r of 3 or more, and for r equal to 2 a shorter alternative proof of a recent result by Campos, Griffiths, Morris and Sahasrabudhe. The talk is based on joint work with Paul Balister, Bela Bollobas, Marcelo Campos, Simon Griffiths, Eoin Hurley, Robert Morris and Julian Sahasrabudhe, and walks through the combinatorial techniques behind the bound. Delivered at Simonyi Hall, the lecture is aimed at researchers in extremal and probabilistic combinatorics.