TY - JOUR

T1 - Bart-Moe games, JumbleG and discrepancy

AU - Hefetz, Dan

AU - Krivelevich, Michael

AU - Szabó, Tibor

N1 - Funding Information:
This paper is a part of the first author’s Ph.D. under the supervision of Professor Michael Krivelevich. The second author’s research was supported in part by a USA–Israeli BSF grant and a grant from the Israeli Science Foundation.

PY - 2007/5

Y1 - 2007/5

N2 - Let A and B be hypergraphs with a common vertex set V. In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V. The game ends when every vertex has been claimed by one of the players. The first player, called Bart (to denote his role as Breaker and Avoider together), selects p vertices per move and the second player, called Moe (to denote his role as Maker or Enforcer), selects q vertices per move. Bart wins the game iff he has at least one vertex in every hyperedge B ∈ B and no complete hyperedge A ∈ A. We prove a sufficient condition for Bart to win the (p, 1) game, for every positive integer p. We then apply this criterion to two different games in which the first player's aim is to build a pseudo-random graph of density frac(p, p + 1), and to a discrepancy game.

AB - Let A and B be hypergraphs with a common vertex set V. In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V. The game ends when every vertex has been claimed by one of the players. The first player, called Bart (to denote his role as Breaker and Avoider together), selects p vertices per move and the second player, called Moe (to denote his role as Maker or Enforcer), selects q vertices per move. Bart wins the game iff he has at least one vertex in every hyperedge B ∈ B and no complete hyperedge A ∈ A. We prove a sufficient condition for Bart to win the (p, 1) game, for every positive integer p. We then apply this criterion to two different games in which the first player's aim is to build a pseudo-random graph of density frac(p, p + 1), and to a discrepancy game.

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

U2 - 10.1016/j.ejc.2006.03.004

DO - 10.1016/j.ejc.2006.03.004

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33847648936

SN - 0195-6698

VL - 28

SP - 1131

EP - 1143

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 4

ER -