Doubly biased Maker-Breaker Connectivity game
Combinatorics
2016-08-14 v1
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.
Keywords
Cite
@article{arxiv.1101.3932,
title = {Doubly biased Maker-Breaker Connectivity game},
author = {Dan Hefetz and Mirjana Rakić and Miloš Stojaković},
journal= {arXiv preprint arXiv:1101.3932},
year = {2016}
}