Connected Graph Game
Connected Graph Game
L. Csirmaz:
Connected Graph Game
Two players claim alternately edges of the complete graph on n vertices.
The winner is the one who makes the spanned subgraph with the claimed
edges connected. We determine, for each n, who wins the game. The
avoidance
version is also considered, where the player who is forced to make the
spanned subgraph to be connected, loses the game.