On minimal Ramsey graphs and Ramsey equivalence in multiple colours

Dennis Clemens, Anita Liebenau, Damian Reding

For an integer $q\ge 2$, a graph $G$ is called $q$-Ramsey for a graph $H$ if every $q$-colouring of the edges of $G$ contains a monochromatic copy of $H$. If $G$ is $q$-Ramsey for…