This monograph is an outcome of the Oberwolfach Seminar on Positional Games, given by
the authors at the Mathematisches Forschungsinstitut Oberwolfach (MFO) in Oberwolfach …

Abstract We study the Maker‐Breaker H‐game played on the edge set of the random graph.
In this game two players, Maker and Breaker, alternately claim unclaimed edges of, until all …

Abstract We study Maker‐Breaker games played on the edge set of a random graph.
Specifically, we analyze the moment a typical random graph process first becomes a …

We study the Hamilton cycle Maker–Breaker game, played on the edges of the random
graph G (n, p). We prove a conjecture from (Stojaković and Szabó, Random Struct and …

ABSTRACT We study the Maker‐Breaker k‐clique game played on the edge set of the
random graph G (n, p). In this game, two players, Maker and Breaker, alternately claim …

We analyze the duration of the unbiased Avoider-Enforcer game for three basic positional
games. All the games are played on the edges of the complete graph on $ n $ vertices, and …

The topic of this thesis are different variants of Maker-Breaker positional game, where two
players Maker and Breaker alternatively take turns in claiming unclaimed edges/vertices of a …

Positional Games is a branch of Combinatorics which focuses on a variety of two player
games, ranging from well-known games such as Tic-Tac-Toe and Hex, to purely abstract …

U ovoj tezi proučavamo kombinatorne igre na grafovima koje igraju 2 igrača. Posebnu
pažnju posvećujemo jakim pozicionim igrama, u kojima oba igrača imaju isti cilj. Prvo …

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 …