| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647495 | Discrete Mathematics | 2013 | 10 Pages |
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átal and ErdÅ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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Asaf Ferber, Michael Krivelevich, Alon Naor,