Abstract
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on it vertices. We determine the winner for almost all values of a and b.
| Original language | English |
|---|---|
| Pages (from-to) | P61 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 19 |
| Issue number | 1 |
| Publication status | Published - 1 Mar 2012 |
Keywords
- biased games
- connectivity
- Maker-Breaker games