Avoider-forcer games on hypergraphs with small rank

MaRDI QIDQ405059zbMATH OpenFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatorial gameavoider-enforcer gameavoider-forcer game

Mathematics Subject Classification ID

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

Recommendations

• Avoider-enforcer star games
• Avoider-Enforcer: the rules of the game
• Avoider-enforcer: the rules of the game
• Keeping avoider's graph almost acyclic
• Biased positional games and small hypergraphs with large covers

Cites work

• Asymptotic random graph intuition for the biased connectivity game
• Avoider-Enforcer games
• Avoider-Enforcer games played on edge disjoint hypergraphs
• Avoider-enforcer: the rules of the game
• Biased Positional Games
• Biased positional games and small hypergraphs with large covers
• Biased positional games for which random strategies are nearly optimal
• Combinatorial Games
• Hypergraph containers
• Independent sets in hypergraphs
• Planarity, Colorability, and Minor Games
• Remarks on positional games. I
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛

Cited in

(3)

• \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
• On the separation conjecture in avoider-enforcer games
• Keeping avoider's graph almost acyclic

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

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