Sciweavers

CPC
2010
74views more  CPC 2010»
13 years 8 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
SIAMDM
2008
89views more  SIAMDM 2008»
13 years 10 months ago
Planarity, Colorability, and Minor Games
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
CPC
2008
51views more  CPC 2008»
13 years 11 months ago
Winning Fast in Sparse Graph Construction Games
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
Ohad N. Feldheim, Michael Krivelevich