Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Maker-Breaker percolation game on the square lattice (2105.12864v1)

Published 26 May 2021 in math.CO

Abstract: We study the $(m,b)$ Maker-Breaker percolation game on $\mathbb{Z}2$, introduced by Day and Falgas-Ravry. As our first result, we show that Breaker has a winning strategy for the $(m,b)$-game whenever $b \geq (2-\frac{1}{14} + o(1))m$, breaking the ratio $2$ barrier proved by Day and Falgas-Ravry. Addressing further questions of Day and Falgas-Ravry, we show that Breaker can win the $(m,2m)$-game even if he allows Maker to claim $c$ edges before the game starts, for any integer $c$, and that he can moreover win rather fast (as a function of $c$). Finally, we consider the game played on $\mathbb{Z}2$ after the usual bond percolation process with parameter $p$ was performed. We show that when $p$ is not too much larger than $1/2$, Breaker almost surely has a winning strategy for the $(1,1)$-game, even if Maker is allowed to choose the origin after the board is determined.

Summary

We haven't generated a summary for this paper yet.