Tight Ramsey bounds for multiple copies of a graph

Matija Bucic, Benny Sudakov

The Ramsey number $r(G)$ of a graph $G$ is the smallest integer $n$ such that any $2$ colouring of the edges of a clique on $n$ vertices contains a monochromatic copy of $G$. Deter…