On the WalkerMaker-WalkerBreaker games

We study the unbiased WalkerMaker-WalkerBreaker games on the edge set of the complete graph on $n$ vertices, $K_n$, a variant of well-known Maker-Breaker positional games, where both players have the restriction on the way of playing. Namely, each player has to choose her/his edges according to a walk. Here, we focus on two standard graph games - the Connectivity game and the Hamilton cycle game and show how quickly WalkerMaker can win both games.

[1]  Michael Krivelevich,et al.  Positional Games , 2014, 1404.2731.

[2]  P. Erdös,et al.  Biased Positional Games , 1978 .

[3]  Michael Krivelevich,et al.  Fast winning strategies in Maker-Breaker games , 2009, J. Comb. Theory, Ser. B.

[4]  Sara C. Billey,et al.  Affine Partitions and Affine Grassmannians , 2008, Electron. J. Comb..

[5]  D. West.  Introduction to Graph Theory , 1995 .

[6]  Tuan Tran,et al.  Creating cycles in Walker-Breaker games , 2015, Discret. Math..

[7]  Michael Krivelevich,et al.  Walker-Breaker Games , 2015 .

[8]  Sebastian U. Stich,et al.  On Two Problems Regarding the Hamiltonian Cycle Game , 2009, Electron. J. Comb..

[9]  J. Beck.  Combinatorial Games: Tic-Tac-Toe Theory , 2008 .

[10]  Tibor Szabó,et al.  Positional games on random graphs , 2006, Random Struct. Algorithms.

[11]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .