Biased games on random boards

DOI10.1002/rsa.20528zbMath1325.91014arXiv1210.7618OpenAlexW1530612577MaRDI QIDQ5265341

Michael Krivelevich, Asaf Ferber, Alon Naor, Roman Glebov

Publication date: 23 July 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphspositional games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

Creating cycles in walker-breaker games ⋮ Galton–Watson games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Connector-breaker games on random boards ⋮ Random directed graphs are robustly Hamiltonian ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs

Cites Work

• Hamilton cycles in highly connected and expanding graphs
• On two Hamilton cycle problems in random graphs
• Biased positional games and small hypergraphs with large covers
• On two problems regarding the Hamiltonian cycle game
• Avoider-Enforcer games
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• Hitting time results for Maker-Breaker games
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Fast Strategies In Maker–Breaker Games Played on Random Boards
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• Remarks on positional games. I
• Biased Positional Games
• Positional games on random graphs
• Combinatorial Games
• A Solution of the Shannon Switching Game

This page was built for publication: Biased games on random boards