Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/1905| Title: | Fast strategies in biased Maker-Breaker games | Authors: | Mikalački (Rakić), Mirjana Stojaković, Mila |
Issue Date: | 1-Jan-2018 | Journal: | Discrete Mathematics and Theoretical Computer Science | Abstract: | © 2018 by the author(s). 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 the 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/1905 | ISSN: | 14627264 |
| Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on Feb 22, 2020
Page view(s)
15
Last Week
3
3
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.