Upper bounds for multicolour Ramsey numbers

Paul Balister, Béla Bollobás, Marcelo Campos +5

The $r$-colour Ramsey number $R_r(k)$ is the minimum $n\in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochroma…