Preprint
Sep 2026
Ramsey-type results for Maker-Breaker games
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$-colouring that does not contain such a monochromatic copy. Characterizing minimal Ramsey graphs is a widely studied problem. Recent research...
A. Allin, Juri Barkey, Dennis Clemens
· 1 citation