Maker‐breaker games on random geometric graphs

DOI10.1002/rsa.20572zbMath1320.05083arXiv1309.5759OpenAlexW2144829613WikidataQ57401420 ScholiaQ57401420MaRDI QIDQ5256385

Miloš Stojaković, Andrew Beveridge, Andrzej Dudek, Tobias Müller, Alan M. Frieze

Publication date: 22 June 2015

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

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

zbMATH Keywords

random geometric graphsmaker-breaker games

Mathematics Subject Classification ID

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

Related Items (3)

Galton–Watson games ⋮ Exponential rate for the contact process extinction time ⋮ The acquaintance time of (percolated) random geometric graphs

Cites Work

• Unnamed Item
• On the chromatic number of random geometric graphs
• Two moments suffice for Poisson approximations: The Chen-Stein method
• The longest edge of the random minimal spanning tree
• Positional games and the second moment method
• Two-point concentration in random geometric graphs
• On the threshold for the Maker-BreakerH-game
• Hitting time results for Maker-Breaker games
• A threshold for the Maker-Breaker clique game
• The cover time of random geometric graphs
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
• A sharp threshold for the Hamilton cycle Maker–Breaker game
• Random Plane Networks
• Regularity and Positional Games
• Biased Positional Games
• Random Geometric Graphs
• Positional games on random graphs
• Random channel assignment in the plane
• A Solution of the Shannon Switching Game

This page was built for publication: Maker‐breaker games on random geometric graphs