Doubly biased maker-breaker connectivity game (Q426836)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Doubly biased maker-breaker connectivity game |
scientific article; zbMATH DE number 6045685
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Doubly biased maker-breaker connectivity game |
scientific article; zbMATH DE number 6045685 |
Statements
Doubly biased maker-breaker connectivity game (English)
0 references
12 June 2012
0 references
In this article the authors analyze the \((a : b)\) Maker-Breaker connectivity game, played on the edge set of the complete graph on \(n\) vertices. They develop theory that allows one to determine the winner for almost all values of \(a\) and \(b\). The article includes a short but concise overview of work on this class of games and finishes with some remarks and open problems.
0 references
maker-breaker games
0 references
biased games
0 references
connectivity
0 references
games on graphs
0 references
