Maker-Breaker games on infinite graphs with precolored edges

Nathan Bowler, Florian Gut, Henri Ortmüller

Suppose we are given graphs $B$ and $G$. In the classical Maker-Breaker game $\text{MB}(B,G)$ two players, Maker and Breaker, alternately claim edges of $B$ and it is Maker's goal…