Fast embedding of spanning trees in biased Maker-Breaker games

zbMath1274.05320arXiv1010.2857MaRDI QIDQ2857367

Michael Krivelevich, Asaf Ferber, Dan Hefetz

Publication date: 1 November 2013

Full work available at URL: https://arxiv.org/abs/1010.2857

Mathematics Subject Classification ID

Trees (05C05) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Hamilton cycles in highly connected and expanding graphs
• Fast winning strategies in maker-breaker games
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• On Biased Positional Games
• Deterministic Graph Games and a Probabilistic Intuition