Avoider-enforcer: the rules of the game
From MaRDI portal
Publication:966059
DOI10.1016/j.jcta.2009.05.001zbMath1186.91052OpenAlexW2048145627MaRDI QIDQ966059
Tibor Szabó, Dan Hefetz, Michael Krivelevich, Miloš Stojaković
Publication date: 27 April 2010
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2009.05.001
Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (14)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Picker-chooser fixed graph games ⋮ A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ Avoider-Enforcer games played on edge disjoint hypergraphs ⋮ Avoider-forcer games on hypergraphs with small rank ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ On the odd cycle game and connected rules ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ Transitive avoidance games ⋮ Keeping avoider's graph almost acyclic ⋮ On the separation conjecture in avoider-enforcer games ⋮ On strong avoiding games ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bart--Moe games, JumbleG and discrepancy
- Biased positional games and small hypergraphs with large covers
- Van der Waerden and Ramsey type games
- A note on biased and non-biased games
- Avoider-Enforcer games
- Planarity, Colorability, and Minor Games
- Biased Positional Games
- Combinatorial Games
- Positional Games
- The Game of JumbleG
This page was built for publication: Avoider-enforcer: the rules of the game