Fast strategies in biased Maker--Breaker games
We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. 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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2018-10-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/4033/pdf |
| _version_ | 1797270078633279488 |
|---|---|
| author | Mirjana Mikalački Miloš Stojaković |
| author_facet | Mirjana Mikalački Miloš Stojaković |
| author_sort | Mirjana Mikalački |
| collection | DOAJ |
| description | We study the biased $(1:b)$ Maker--Breaker positional games, played on the
edge set of the complete graph on $n$ vertices, $K_n$. 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. |
| first_indexed | 2024-04-25T01:58:33Z |
| format | Article |
| id | doaj.art-6f774e1946ff4c3bacfaa0915aae7ba3 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:58:33Z |
| publishDate | 2018-10-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-6f774e1946ff4c3bacfaa0915aae7ba32024-03-07T15:37:21ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502018-10-01vol. 20 no. 2Graph Theory10.23638/DMTCS-20-2-64033Fast strategies in biased Maker--Breaker gamesMirjana MikalačkiMiloš Stojakovićhttps://orcid.org/0000-0002-2545-8849We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. 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.https://dmtcs.episciences.org/4033/pdfmathematics - combinatorics91a24 positional games, 91a43 games involving graphs, 91a46 combinatorial games |
| spellingShingle | Mirjana Mikalački Miloš Stojaković Fast strategies in biased Maker--Breaker games Discrete Mathematics & Theoretical Computer Science mathematics - combinatorics 91a24 positional games, 91a43 games involving graphs, 91a46 combinatorial games |
| title | Fast strategies in biased Maker--Breaker games |
| title_full | Fast strategies in biased Maker--Breaker games |
| title_fullStr | Fast strategies in biased Maker--Breaker games |
| title_full_unstemmed | Fast strategies in biased Maker--Breaker games |
| title_short | Fast strategies in biased Maker--Breaker games |
| title_sort | fast strategies in biased maker breaker games |
| topic | mathematics - combinatorics 91a24 positional games, 91a43 games involving graphs, 91a46 combinatorial games |
| url | https://dmtcs.episciences.org/4033/pdf |
| work_keys_str_mv | AT mirjanamikalacki faststrategiesinbiasedmakerbreakergames AT milosstojakovic faststrategiesinbiasedmakerbreakergames |