Asymptotic random graph intuition for the biased connectivity game

DOI10.1002/rsa.20279zbMath1198.91050OpenAlexW4242064191MaRDI QIDQ3055785

Heidi Gebauer, Tibor Szabó

Publication date: 9 November 2010

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

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

zbMATH Keywords

random graphsconnectivitybiased Maker/Breaker games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (37)

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 ⋮ How fast can maker win in fair biased games? ⋮ Avoider-Enforcer games played on edge disjoint hypergraphs ⋮ Random-player maker-breaker games ⋮ Maker-Breaker total domination game on cubic graphs ⋮ 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 ⋮ The Random Graph Intuition for the Tournament Game ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ The speed and threshold of the biased perfect matching and Hamilton cycle games ⋮ On the clique-game ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ Fast embedding of spanning trees in biased Maker-Breaker games ⋮ Component Games on Regular Graphs ⋮ Sharp thresholds for half-random games. II ⋮ Connector-breaker games on random boards ⋮ The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 ⋮ Maker–Breaker percolation games I: crossing grids ⋮ The toucher-isolator game ⋮ 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
• Biased positional games and small hypergraphs with large covers
• Biased positional games and the phase transition
• Remarks on positional games. I
• Deterministic Graph Games and a Probabilistic Intuition
• A Solution of the Shannon Switching Game

This page was built for publication: Asymptotic random graph intuition for the biased connectivity game