Pages that link to "Item:Q966059"
From MaRDI portal
The following pages link to Avoider-enforcer: the rules of the game (Q966059):
Displaying 16 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Picker-chooser fixed graph games (Q273174) (← links)
- A non-trivial upper bound on the threshold bias of the oriented-cycle game (Q345067) (← links)
- Avoider-Enforcer games played on edge disjoint hypergraphs (Q394298) (← links)
- Avoider-forcer games on hypergraphs with small rank (Q405059) (← links)
- Transitive avoidance games (Q521391) (← links)
- On strong avoiding games (Q2111931) (← links)
- On the odd cycle game and connected rules (Q2198973) (← links)
- Keeping avoider's graph almost acyclic (Q2260635) (← links)
- On the separation conjecture in avoider-enforcer games (Q2312614) (← links)
- Waiter-client and client-waiter Hamiltonicity games on random graphs (Q2357219) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Avoider-Enforcer: the rules of the game (Q2851474) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- Manipulative Waiters with Probabilistic Intuition (Q5366922) (← links)
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs (Q6098463) (← links)
