Publisher DOI: 10.1016/j.disc.2017.06.023
Title: How fast can Maker win in fair biased games?
Language: English
Authors: Clemens, Dennis 
Mikalački, Mirjana 
Keywords: Fast winning;Games on graphs;Maker–Breaker games;Strong games
Issue Date: 1-Jan-2018
Source: Discrete Mathematics 1 (341): 51-66 (2018)
Journal or Series Name: Discrete mathematics 
Abstract (english): 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.
ISSN: 0012-365X
Institute: Mathematik E-10 
Type: (wissenschaftlicher) Artikel
Appears in Collections:Publications without fulltext

Show full item record

Page view(s)

Last Week
Last month
checked on Aug 12, 2020

Google ScholarTM


Add Files to Item

Note about this record


Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.