# Miloš Stojaković : Breaker games on random boards

Date of publication: 3. 10. 2024

Discrete mathematics seminar

Tuesday

8

October

Time:

10:15

Location:

Plemljev seminar, Jadranska 19

**Abstract**: In Maker-Breaker games played on edge sets of graphs, two players, Maker and Breaker, alternately claim unclaimed edges of a given graph until all of its edges are claimed. Maker wins the game if he claims all edges of one representative of a prescribed graph-theoretic structure (e.g. a Hamiltonian cycle, or a fixed graph H). Breaker wins otherwise.

We take a closer look at various Maker-Breaker games played on the edge sets of random graphs.