On the threshold for the Maker-BreakerH-game

DOI10.1002/rsa.20628zbMath1349.05316arXiv1401.4384OpenAlexW2593199250MaRDI QIDQ2830239

Rajko Nenadov, Miloš Stojaković, Angelika Steger

Publication date: 9 November 2016

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

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

zbMATH Keywords

random graphspositional gamesmaker-breaker game

Mathematics Subject Classification ID

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

Related Items (12)

Creating cycles in walker-breaker games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ Multistage positional games ⋮ Fast strategies in Waiter-Client games ⋮ Client-waiter games on complete and random graphs ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Waiter-client triangle-factor game on the edges of the complete graph ⋮ Connector-breaker games on random boards ⋮ Maker‐breaker games on random geometric graphs ⋮ Maker-Breaker Games on Randomly Perturbed Graphs

Cites Work

• Unnamed Item
• Hypergraph containers
• Biased positional games and small hypergraphs with large covers
• Threshold functions
• Avoider-Enforcer games
• Positional games
• A threshold for the Maker-Breaker clique game
• Threshold functions for small subgraphs
• Random graphs with monochromatic triangles in every edge coloring
• Positional games on random graphs
• Threshold Functions for Ramsey Properties
• Independent sets in hypergraphs
• A Short Proof of the Random Ramsey Theorem
• Decomposition of Finite Graphs Into Forests
• On a combinatorial game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: On the threshold for the Maker-BreakerH-game