Connected graph game
László Csirmaz · Studia Scientiarum Mathematicarum Hungarica · 2002
Two players claim alternatively 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.