Options
How fast can Maker win in fair biased games?
Publikationstyp
Journal Article
Date Issued
2018-01-01
Sprache
English
Author(s)
Institut
TORE-URI
Journal
Volume
341
Issue
1
Start Page
51
End Page
66
Citation
Discrete Mathematics 1 (341): 51-66 (2018)
Publisher DOI
Scopus ID
We study (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, Hamilton cycle 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 first player can win in the strong version of these games.
Subjects
Fast winning
Games on graphs
Maker–Breaker games
Strong games