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 |
| Summary: | 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. |
|---|---|
| ISSN: | 1365-8050 |