Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-17 |
| Number of pages | 17 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 19 |
| DOIs | |
| State | Published - 31 Mar 2012 |
| Externally published | Yes |
Keywords
- Biased games
- Connectivity
- Maker-breaker games
Fingerprint
Dive into the research topics of 'Doubly biased maker-breaker connectivity game'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver