论文信息 - Winning fast in biased Maker-Breaker games

Winning fast in biased Maker-Breaker games

Abstract We study the biased (1 : b ) Maker-Breaker positional games, played on the edge set of the complete graph on n vertices, K n . Given Breaker's bias b , possibly depending on n , we determine the bounds for minimal number of moves, depending on b , in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game.

Milos Stojakovic | Mirjana Mikalacki

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

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

[3] Asaf Ferber,et al. Winning Strong Games through Fast Strategies for Weak Games , 2011, Electron. J. Comb..

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

[5] Mirjana Mikalacki,et al. How fast can Maker win in fair biased games? , 2016, Discret. Math..

[6] Asaf Ferber,et al. Weak and strong kk-connectivity games , 2012, Eur. J. Comb..

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

[8] Tibor Szabó,et al. Asymptotic random graph intuition for the biased connectivity game , 2009 .

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

[10] Michael Krivelevich. The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$ , 2009 .

[11] Michael Krivelevich,et al. Fast Strategies In Maker–Breaker Games Played on Random Boards , 2012, Combinatorics, Probability and Computing.