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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
