Avoider-Enforcer games played on edge disjoint hypergraphs
From MaRDI portal
Publication:394298
DOI10.1016/J.DISC.2013.09.008zbMath1281.05095arXiv1208.5878OpenAlexW1989811398MaRDI QIDQ394298
Asaf Ferber, Michael Krivelevich, Alon Naor
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.5878
Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Avoider-forcer games on hypergraphs with small rank ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
Cites Work
- Unnamed Item
- Avoider-enforcer: the rules of the game
- Biased positional games and small hypergraphs with large covers
- Avoider-Enforcer games
- Asymptotic random graph intuition for the biased connectivity game
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Biased Positional Games
- Combinatorial Games
- On a combinatorial game
This page was built for publication: Avoider-Enforcer games played on edge disjoint hypergraphs
