Avoider-Enforcer games played on edge disjoint hypergraphs

Asaf Ferber; Michael Krivelevich; Alon Naor

doi:10.1016/j.disc.2013.09.008

Avoider-Enforcer games played on edge disjoint hypergraphs

Asaf Ferber, Michael Krivelevich, Alon Naor

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

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 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.

Original language	English
Pages (from-to)	2932-2941
Number of pages	10
Journal	Discrete Mathematics
Volume	313
Issue number	24
DOIs	https://doi.org/10.1016/j.disc.2013.09.008
State	Published - 2013

Keywords

Avoider-Enforcer
Positional games

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2013.09.008

Cite this

@article{99cfb8a68d354954989c2625ac75ffcb,

title = "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{\'a}tal 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.",

keywords = "Avoider-Enforcer, Positional games",

author = "Asaf Ferber and Michael Krivelevich and Alon Naor",

note = "Funding Information: The second author{\textquoteright}s research was supported in part by USA-Israel BSF Grant 2010115 and by grant 912/12 from the Israel Science Foundation .",

year = "2013",

doi = "10.1016/j.disc.2013.09.008",

language = "الإنجليزيّة",

volume = "313",

pages = "2932--2941",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "24",

}

TY - JOUR

T1 - Avoider-Enforcer games played on edge disjoint hypergraphs

AU - Ferber, Asaf

AU - Krivelevich, Michael

AU - Naor, Alon

N1 - Funding Information: The second author’s research was supported in part by USA-Israel BSF Grant 2010115 and by grant 912/12 from the Israel Science Foundation .

PY - 2013

Y1 - 2013

N2 - 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 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.

AB - 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 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.

KW - Avoider-Enforcer

KW - Positional games

UR - http://www.scopus.com/inward/record.url?scp=84885119841&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2013.09.008

DO - 10.1016/j.disc.2013.09.008

M3 - مقالة

SN - 0012-365X

VL - 313

SP - 2932

EP - 2941

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 24

ER -

Avoider-Enforcer games played on edge disjoint hypergraphs

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this