Fast strategies in biased Maker-Breaker games
暂无分享,去创建一个
[1] J. Beck. Combinatorial Games: Tic-Tac-Toe Theory , 2008 .
[2] Benny Sudakov,et al. The size Ramsey number of a directed path , 2010, Journal of combinatorial theory. Series B (Print).
[3] Dominique de Caen,et al. An upper bound on the sum of squares of degrees in a graph , 1998, Discret. Math..
[4] Michael Krivelevich. The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$ , 2009 .
[5] Michael Krivelevich,et al. Hamilton cycles in highly connected and expanding graphs , 2006, Comb..
[6] P. Lax. Proof of a conjecture of P. Erdös on the derivative of a polynomial , 1944 .
[7] Michael Krivelevich,et al. Fast embedding of spanning trees in biased Maker-Breaker games , 2010, Eur. J. Comb..
[8] P. Erdös,et al. Biased Positional Games , 1978 .
[9] Tibor Szabó,et al. Asymptotic random graph intuition for the biased connectivity game , 2009, Random Struct. Algorithms.
[10] Asaf Ferber,et al. Weak and strong kk-connectivity games , 2012, Eur. J. Comb..
[11] Asaf Ferber,et al. Winning Strong Games through Fast Strategies for Weak Games , 2011, Electron. J. Comb..
[12] Michael Krivelevich,et al. Fast winning strategies in Maker-Breaker games , 2009, J. Comb. Theory, Ser. B.
[13] Michael Krivelevich,et al. Fast Strategies In Maker–Breaker Games Played on Random Boards , 2012, Combinatorics, Probability and Computing.
[14] Michael Krivelevich,et al. Positional Games , 2014, 1404.2731.
[15] Mirjana Mikalacki,et al. How fast can Maker win in fair biased games? , 2016, Discret. Math..
[16] L. Pósa,et al. Hamiltonian circuits in random graphs , 1976, Discret. Math..
[17] Sebastian U. Stich,et al. On Two Problems Regarding the Hamiltonian Cycle Game , 2009, Electron. J. Comb..
[18] D. West. Introduction to Graph Theory , 1995 .