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
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics