Upper bounds for multicolour Ramsey numbers
Paul Balister, Béla Bollobás, Marcelo Campos, Simon Griffiths et autres
The r r -colour Ramsey number R r ( k ) R_r(k) is the minimum n ∈ N n \in \mathbb {N} such that every r r -colouring of the edges of the complete graph K n K_n on n n vertices …