Oliver Krüger: A playful introduction to Maker-Breaker games

We will introduce the notion of a type of combinatorial games
(two-player, perfect information games with no chance) called
"Maker-Breaker games" and give some examples of such.

These games have turned out to be a quite useful tool in the study of
some extremal properties of (hyper)graphs, where some extremal graph
problems can be reformulated as problems concerning Maker-Breaker
games. We will briefly discuss some of the primary results concerning
these games, such as the Erdős-Selfridge criterion. We will also go
through the connection between proper 2-colorings of the vertices of
hypergraphs and Maker-Breaker games.