Graphs with arbitrary Ramsey number and connectivity

Isabel Ahme, Alex Scott

The Ramsey number $r(G)$ of a graph $G$ is the minimum number $N$ such that any red-blue colouring of the edges of $K_N$ contains a monochromatic copy of $G$. Pavez-Signé, Piga and…