Doubly biased Maker-Breaker Connectivity game
classification
🧮 math.CO
keywords
connectivitygamemaker-breakeralmostbiasedcompletedeterminedoubly
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.