Tightness of the mindegree-1 Maker-PhantomBreaker lower bound
Let be positive integers such that is an integer. In the mindegree-1 Maker-PhantomBreaker game on , Maker seeks to claim at least one edge incident with every vertex, while PhantomBreaker claims edges according to the random PhantomBreaker rule of the game.
Mindegree-1 tightness conjecture. Maker has a randomized strategy to win with probability at least
The paper states that this bound from Theorem~ is conjectured to be tight. The supplied text does not give evidence resolving the conjecture, so its status remains open.
References
- Dennis Clemens, Fabian Hamann, Mirjana Mikalački, Yannick Mogge and Miloš Stojaković, “Maker playing against an invisible Breaker”, arXiv:2507.22519 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.