Avoider-Enforcer games played on edge disjoint hypergraphs
Combinatorics
2013-09-10 v4
Abstract
We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing an analog of the classic and well known game , due to Chv\'{a}tal and Erd\H{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.
Keywords
Cite
@article{arxiv.1208.5878,
title = {Avoider-Enforcer games played on edge disjoint hypergraphs},
author = {Asaf Ferber and Michael Krivelevich and Alon Naor},
journal= {arXiv preprint arXiv:1208.5878},
year = {2013}
}