论文信息 - Maker Breaker on digraphs

Maker Breaker on digraphs

We study two biassed Maker-Breaker games played on the complete digraph $\vec{K}_n$. In the strong connectivity game, Maker wants to build a strongly connected subgraph. We determine the asymptotic optimal bias for this game viz. $\frac{n}{\log n}$. In the Hamiltonian game, Maker wants to build a Hamiltonian subgraph. We determine the asymptotic optimal bias for this game up to a constant factor.

Alan M. Frieze | Wesley Pegden | A. Frieze | W. Pegden

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

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

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

[4] Tibor Szabó,et al. Asymptotic random graph intuition for the biased connectivity game , 2009, Random Struct. Algorithms.

[5] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.