Doubly Biased Maker-Breaker Connectivity Game
In this paper we study the (a:b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.
Gespeichert in:
| Veröffentlicht in: | The Electronic journal of combinatorics 2012-03, Vol.19 (1) |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this paper we study the (a:b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b. |
|---|---|
| ISSN: | 1077-8926 1077-8926 |
| DOI: | 10.37236/2129 |