Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/3047| Title: | Winning fast in biased Maker-Breaker games | Authors: | Mikalački (Rakić), Mirjana Stojaković, Mila |
Issue Date: | 1-Aug-2017 | Journal: | Electronic Notes in Discrete Mathematics | Abstract: | © 2017 Elsevier B.V. We study the biased (1 : b) Maker-Breaker positional games, played on the edge set of the complete graph on n vertices, Kn. Given Breaker's bias b, possibly depending on n, we determine the bounds for minimal number of moves, depending on b, in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game. | URI: | https://open.uns.ac.rs/handle/123456789/3047 | DOI: | 10.1016/j.endm.2017.07.047 |
| Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
2
checked on May 3, 2024
Page view(s)
23
Last Week
10
10
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.