The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
From MaRDI portal
Publication:3074554
DOI10.1090/S0894-0347-2010-00678-9zbMath1205.91042arXiv0909.2744OpenAlexW2079376502WikidataQ105585021 ScholiaQ105585021MaRDI QIDQ3074554
Publication date: 9 February 2011
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.2744
Related Items
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Creating cycles in walker-breaker games ⋮ Generating random graphs in biased Maker-Breaker games ⋮ Spanning Structures in Walker–Breaker Games ⋮ A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ A threshold for the Maker-Breaker clique game ⋮ The threshold bias of the clique-factor game ⋮ Avoider-Enforcer games played on edge disjoint hypergraphs ⋮ Random-player maker-breaker games ⋮ Maker-Breaker total domination game on cubic graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Maker Breaker on digraphs ⋮ Sharp thresholds for half-random games I ⋮ Avoider-forcer games on hypergraphs with small rank ⋮ Winning fast in biased maker-breaker games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Biased orientation games ⋮ Multistage positional games ⋮ Fast winning strategies for staller in the maker-breaker domination game ⋮ On the odd cycle game and connected rules ⋮ Fast strategies in Waiter-Client games ⋮ Fast embedding of spanning trees in biased maker-breaker games ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ The speed and threshold of the biased perfect matching and Hamilton cycle games ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ Fast embedding of spanning trees in biased Maker-Breaker games ⋮ Generalized pairing strategies -- a bridge from pairing strategies to colorings ⋮ On the Hamiltonicity of the \(k\)-regular graph game ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Sharp thresholds for half-random games. II ⋮ Connector-breaker games on random boards ⋮ Hamiltonian Maker–Breaker Games on Small Graphs ⋮ A strategy for isolator in the toucher-isolator game on trees ⋮ Maker–Breaker percolation games I: crossing grids ⋮ The toucher-isolator game ⋮ Maker‐breaker games on random geometric graphs ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Biased games on random boards ⋮ Efficient Winning Strategies in Random‐Turn Maker–Breaker Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Biased positional games and small hypergraphs with large covers
- On two problems regarding the Hamiltonian cycle game
- Hamiltonian circuits in random graphs
- Fast winning strategies in maker-breaker games
- Asymptotic random graph intuition for the biased connectivity game
- Hamiltonicity thresholds in Achlioptas processes
- Biased Positional Games
- Combinatorial Games
