A sharp threshold for the Hamilton cycle Maker–Breaker game

DOI10.1002/rsa.20252zbMath1182.91050OpenAlexW4236302493MaRDI QIDQ3608315

Miloš Stojaković, Michael Krivelevich, Tibor Szabó, Dan Hefetz

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1002/rsa.20252

zbMATH Keywords

random graphcombinatorial gamesHamilton cycle

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Creating cycles in walker-breaker games ⋮ Hitting time results for Maker-Breaker games ⋮ A threshold for the Maker-Breaker clique game ⋮ Global maker-breaker games on sparse graphs ⋮ Hamilton cycles in highly connected and expanding graphs ⋮ On the Hamiltonicity of the \(k\)-regular graph game ⋮ Connector-breaker games on random boards ⋮ Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs ⋮ Random directed graphs are robustly Hamiltonian ⋮ Maker‐breaker games on random geometric graphs ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Biased games on random boards ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs

Cites Work

• Hamilton cycles in highly connected and expanding graphs
• On size Ramsey number of paths, trees, and circuits. I
• Combinatorial Games
• A Solution of the Shannon Switching Game

This page was built for publication: A sharp threshold for the Hamilton cycle Maker–Breaker game