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.
@article{10_37236_2129,
author = {Dan Hefetz and Mirjana Mikala\v{c}ki and Milo\v{s} Stojakovi\'c},
title = {Doubly biased maker-breaker connectivity game},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {1},
doi = {10.37236/2129},
zbl = {1279.91033},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2129/}
}
TY - JOUR
AU - Dan Hefetz
AU - Mirjana Mikalački
AU - Miloš Stojaković
TI - Doubly biased maker-breaker connectivity game
JO - The electronic journal of combinatorics
PY - 2012
VL - 19
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/2129/
DO - 10.37236/2129
ID - 10_37236_2129
ER -
%0 Journal Article
%A Dan Hefetz
%A Mirjana Mikalački
%A Miloš Stojaković
%T Doubly biased maker-breaker connectivity game
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2129/
%R 10.37236/2129
%F 10_37236_2129
Dan Hefetz; Mirjana Mikalački; Miloš Stojaković. Doubly biased maker-breaker connectivity game. The electronic journal of combinatorics, Tome 19 (2012) no. 1. doi: 10.37236/2129