2011/01/20 by Hefetz, Dan, Rakić, Mirjana, Stojaković, Miloš · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1101.3932
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.