Given an increasing graph property F, the strong Avoider-Avoider F game is played on the
edge set of a complete graph. Two players, Red and Blue, take turns in claiming previously …

We consider the following combinatorial two-player game: On the random tree arising from a
branching process, each round one player (Breaker) deletes an edge and by that removes …

By now, the Maker-Breaker connectivity game on a complete graph $ K_n $ or on a random
graph $ G\sim G_ {n, p} $ is well studied. Recently, London and Pluh\'ar suggested a variant …

In this thesis, we study 2-player combinatorial games on graphs, which means that they are
played with perfect information, no chance moves and sequentially play. Structurally, a …

The Maker-Breaker connectivity game and Hamilton cycle game belong to the best studied
games in positional games theory, including results on biased games, games on random …

In this thesis, we study 2-player combinatorial games on graphs, which means that they are
played with perfect information, no chance moves and sequentially play. Structurally, a …

The (m: b) maker-breaker connectivity game is played on a graph G. First, the maker claims
up to m edges of the graph. Following this, the breaker claims up to b edges. The players …