Work

Avoider-Enforcer games played on edge disjoint hypergraphs

Year: 2012

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1208.5878

Authors: Ferber, Asaf, Krivelevich, Michael, Naor, Alon

Institution: Tel Aviv University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2951301016

Cites: 8

Cited by: 1

Related to: 20