The diameter game

DOI10.1002/rsa.20280zbMath1198.91049arXiv1605.05698MaRDI QIDQ3055780

András Pluhár, József Balogh, Ryan R. Martin

Publication date: 9 November 2010

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

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

zbMATH Keywords

random graphs; diameter; positional games

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

91A43: Games involving graphs

05C12: Distance in graphs

91A24: Positional games (pursuit and evasion, etc.)

05C57: Games on graphs (graph-theoretic aspects)

Related Items

Spanning Structures in Walker–Breaker Games, The Random Graph Intuition for the Tournament Game, Winning fast in fair biased maker-breaker games, Biased orientation games, On the clique-game, The picker-chooser diameter game, On chooser-picker positional games, Connector-breaker games on random boards, How fast can maker win in fair biased games?

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of some two-person perfect-information games
• Biased positional games and the phase transition
• Planarity, Colorability, and Minor Games
• Remarks on positional games. I
• On a theorem of Beck
• Regularity and Positional Games
• Biased Positional Games
• Deterministic Graph Games and a Probabilistic Intuition
• A Solution of the Shannon Switching Game
• Positional Games
• Biased positional games for which random strategies are nearly optimal
• The accelerated \(k\)-in-a-row game