Fast Strategies In Maker–Breaker Games Played on Random Boards

DOI10.1017/S0963548312000375zbMath1252.05145arXiv1203.3444OpenAlexW2015220785MaRDI QIDQ3168447

Michael Krivelevich, Asaf Ferber, Anita Liebenau, Dennis Clemens

Publication date: 31 October 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

perfect matching game\(k\)-connectivity gameHamiltonicity game

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (10)

Creating cycles in walker-breaker games ⋮ Fast winning strategies for the maker-breaker domination game ⋮ How fast can maker win in fair biased games? ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Random-player maker-breaker games ⋮ Winning fast in biased maker-breaker games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Fast winning strategies for staller in the maker-breaker domination game ⋮ Maker-breaker domination number ⋮ Biased games on random boards

Cites Work

• The size Ramsey number of a directed path
• Fast embedding of spanning trees in biased maker-breaker games
• Hamilton cycles in highly connected and expanding graphs
• Fast winning strategies in maker-breaker games
• Embedding Spanning Trees in Random Graphs
• 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: Fast Strategies In Maker–Breaker Games Played on Random Boards