Connector-Breaker Games on Random Boards

  title={Connector-Breaker Games on Random Boards},
  author={Dennis Clemens and L. Kirsch and Yannick Mogge},
  journal={Electron. J. Comb.},
By now, the Maker-Breaker connectivity game on a complete graph $K_n$ or on a random graph $G\sim G_{n,p}$ is well studied. Recently, London and Pluhár suggested a variant in which Maker always needs to choose her edges in such a way that her graph stays connected. By their results it follows that for this connected version of the game, the threshold bias on $K_n$ and the threshold probability on $G\sim G_{n,p}$ for winning the game drastically differ from the corresponding values for the usual… 

Figures from this paper


Asymptotic random graph intuition for the biased connectivity game
It is shown that Maker, occupying one edge in each of his turns, can build a spanning tree, even if Breaker occupies b ≤ (1 − o(1)) · n lnn edges in each turn, and a strategy for Maker to occupy a graph with minimum degree c while playing against a Breaker.
A sharp threshold for the Hamilton cycle Maker–Breaker game
This theorem can be considered a game-theoretic strengthening of classical results from the theory of random graphs: not only does G(n, p) almost surely admit a Hamilton cycle for p = (1 + ε) log n n, but Maker is able to build one while playing against an adversary.
The diameter game
It is proved that the $2-diameter game has the following surprising property: Breaker wins the game in which each player chooses one edge per turn, but Maker wins as long as he is permitted to choose $2$ edges in each turn.
Biased games on random boards
This paper analyzes biased Maker-Breaker games and Avoider-Enforcer games and proves that, for every p = ω ( ln ⁡ n n ) , G ∼ G ( n, p ) is typically such that the critical bias for all the aforementioned Maker- Breaker games is asymptotically b * = n p ln⁡n .
Generating random graphs in biased Maker‐Breaker games
A general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs is presented and it is shown that for b=on, Maker can build a pancyclic graph that is, a graph that contains cycles of every possible length while playing a 1:b game on EKn.
Positional games on random graphs
The main concern is to determine the threshold probability for the existence of Maker's strategy to claim a member of F in the unbiased game played on the edges of random graph G(n,p) for various target families of winning sets.
Spanning Structures in Walker-Breaker Games
We study the biased (2 : b) Walker–Breaker games, played on the edge set of the complete graph on n vertices, Kn. These games are a variant of the Maker–Breaker games with the restriction that Walker
Biased Positional Games for Which Random Strategies are Nearly Optimal
It is shown that there exist constants and such that Maker has a winning strategy in G(G; n, q) if, while for the game can be won by Breaker.
Biased Positional Games