Options
Winning fast in fair biased Maker-Breaker games
Publikationstyp
Journal Article
Date Issued
2015-11-12
Sprache
English
Author(s)
Institut
TORE-URI
Volume
49
Start Page
353
End Page
358
Citation
Electronic Notes in Discrete Mathematics (49): 353-358 (2015)
Publisher DOI
Scopus ID
We study the (a: a) Maker-Breaker games played on the edge set of the complete graph on n vertices. In the following four games - perfect matching game, Hamiltonicity game, star factor game and path factor game, our goal is to determine the least number of moves which Maker needs in order to win these games. Moreover, for all games except for the star factor game, we show how Red can win in the strong version of these games.
Subjects
biased games
fast strategy
Maker-Breaker games
strong games
DDC Class
510: Mathematik