Ramsey-type results for Maker-Breaker games

Alexander Allin, Juri Barkey, Dennis Clemens

A graph $G$ is minimal Ramsey for a graph $H$ if every $2$-colouring of the edges of $G$ contains a monochromatic copy of $H$, but for every proper subgraph of $G$, there is a $2$-…