Avoider-enforcer star games
From MaRDI portal
Publication:5249233
Abstract: In this paper, we study Avoider-Enforcer games played on the edge set of the complete graph on vertices. For every constant we analyse the -star game, where Avoider tries to avoid claiming edges incident to the same vertex. We analyse both versions of Avoider-Enforcer games -- the strict and the monotone -- and for each provide explicit winning strategies for both players. We determine the order of magnitude of the threshold biases , and , where is the hypergraph of the game.
Recommendations
Cited in
(12)- Avoider-enforcer: the rules of the game
- Avoider-Enforcer games played on edge disjoint hypergraphs
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
- Avoider-forcer games on hypergraphs with small rank
- The star avoidance game
- scientific article; zbMATH DE number 7379291 (Why is no real title available?)
- On avoider-enforcer games
- Fast winning strategies in avoider-enforcer games
- Avoider-Enforcer: the rules of the game
- On the separation conjecture in avoider-enforcer games
- Keeping avoider's graph almost acyclic
- Avoider-Enforcer games
This page was built for publication: Avoider-enforcer star games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249233)