Avoider-Enforcer games

DOI10.1016/J.JCTA.2006.10.001MaRDI QIDQ2371294zbMATH OpenOpenAlexFDO

Authors Dan Hefetz, Michael Krivelevich, Tibor Szabó

Publication date 4 July 2007

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.2006.10.001

zbMATH Keywords

biased gamespositional gamesspanning trees

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Review text

This paper develops an interesting game avoiders theory and develops a number of theorems and lemmas to strengthen the foundation. Biased and non-biased games are discussed and developed. No experiments are performed.

Recommendations

• Avoider-enforcer star games
• Avoider-enforcer: the rules of the game
• Avoider-enforcer star games
• Avoider-Enforcer: the rules of the game
• Keeping avoider's graph almost acyclic

Cites work

• A matching game
• A note on biased and non-biased games
• A Solution of the Shannon Switching Game
• Bart--Moe games, JumbleG and discrepancy
• Biased Positional Games
• Biased positional games on matroids
• Edge-Disjoint Spanning Trees of Finite Graphs
• Hamilton cycles in highly connected and expanding graphs
• scientific article; zbMATH DE number 3970795 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Minimum partition of a matroid into independent subsets
• On a combinatorial game
• On the Problem of Decomposing a Graph into n Connected Factors
• Remarks on positional games. I
• The Game of JumbleG

Cited in

(25)

• Protective and prudent behaviour in games
• On the odd cycle game and connected rules
• Keeping avoider's graph almost acyclic
• On the separation conjecture in avoider-enforcer games
• Waiter-client and client-waiter Hamiltonicity games on random graphs
• Waiter-Client and Client-Waiter planarity, colorability and minor games
• Picker-chooser fixed graph games
• On the threshold for the maker-breaker H-game
• Avoider-Enforcer: the rules of the game
• A non-trivial upper bound on the threshold bias of the oriented-cycle game
• Fast winning strategies in positional games
• Avoider-Enforcer games played on edge disjoint hypergraphs
• Avoider-forcer games on hypergraphs with small rank
• Transitive avoidance games
• Biased games on random boards
• Manipulative waiters with probabilistic intuition
• \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
• Multistage positional games
• Hamilton cycles in highly connected and expanding graphs
• On the Constructor-Blocker game
• The Avoider-Enforcer game in hypergraphs of rank 3
• Fast winning strategies in avoider-enforcer games
• Bart--Moe games, JumbleG and discrepancy
• Avoider-enforcer: the rules of the game
• On winning fast in Avoider-Enforcer games

This page was built for publication: Avoider-Enforcer games

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