Avoider-Enforcer games played on edge disjoint hypergraphs
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\'atal and Erdos. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.