Avoider-Enforcer games played on edge disjoint hypergraphs

DOI10.1016/J.DISC.2013.09.008zbMATH Open1281.05095arXiv1208.5878OpenAlexW1989811398MaRDI QIDQ394298FDOQ394298

Authors: Asaf Ferber, Michael Krivelevich, Alon Naor 

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing an analog of the classic and well known game $Box$, due to Chv'{a}tal and ErdH{o}s. We consider both strict and monotone versions of Avoider-Enforcer games, and for each version we give a sufficient condition to win for each player. We also present applications of our results to several general Avoider-Enforcer games.

Full work available at URL: https://arxiv.org/abs/1208.5878

Recommendations

• Avoider-enforcer star games
• Avoider-enforcer star games
• Avoider-Enforcer: the rules of the game
• On avoider-enforcer games
• Avoider-enforcer: the rules of the game

zbMATH Keywords

positional gamesAvoider-Enforcer

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• Title not available (Why is that?)
• 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
• Avoider-enforcer: the rules of the game
• Biased positional games and small hypergraphs with large covers

Cited In (3)

• Avoider-forcer games on hypergraphs with small rank
• Title not available (Why is that?)
• \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs

This page was built for publication: Avoider-Enforcer games played on edge disjoint hypergraphs

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