Avoider-forcer games on hypergraphs with small rank

zbMath1305.91048MaRDI QIDQ405059

Małgorzata Bednarska-Bzdȩga

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p2

zbMATH Keywords

combinatorial gameavoider-enforcer gameavoider-forcer game

Mathematics Subject Classification ID

2-person games (91A05) Hypergraphs (05C65) Games involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

\(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ On the separation conjecture in avoider-enforcer games

Cites Work

• Avoider-Enforcer games played on edge disjoint hypergraphs
• Hypergraph containers
• 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𝑛
• Planarity, Colorability, and Minor Games
• Remarks on positional games. I
• Biased Positional Games
• Independent sets in hypergraphs
• Combinatorial Games
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Avoider-forcer games on hypergraphs with small rank