A sharp threshold for the Hamilton cycle Maker–Breaker game

DOI10.1002/RSA.20252MaRDI QIDQ3608315zbMATH OpenOpenAlexFDO

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

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

combinatorial gamesHamilton cyclerandom graph

Mathematics Subject Classification ID

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

Recommendations

• On two problems regarding the Hamiltonian cycle game
• On the threshold for the maker-breaker H-game
• Hamiltonian maker-breaker games on small graphs
• Positional games on random graphs
• Hamiltonian games

Cites work

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

Cited in

(22)

• On two problems regarding the Hamiltonian cycle game
• On the Hamiltonicity of the k-regular graph game
• Connector-breaker games on random boards
• Waiter-client and client-waiter Hamiltonicity games on random graphs
• Odd and even cycles in maker-breaker games
• The speed and threshold of the biased perfect matching and Hamilton cycle games
• Random directed graphs are robustly Hamiltonian
• On the threshold for the maker-breaker H-game
• Creating cycles in walker-breaker games
• Hitting time results for maker-breaker games
• A threshold for the maker-breaker clique game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• Hamiltonian maker-breaker games on small graphs
• Maker-Breaker games on randomly perturbed graphs
• Maker-breaker games on random geometric graphs
• Biased games on random boards
• Global maker-breaker games on sparse graphs
• Hamilton cycles in highly connected and expanding graphs
• Walker-breaker games on \(G_{n, p}\)
• Complexity of maker-breaker games on edge sets of graphs
• Tree universality in positional games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608315)