Tightness of the mindegree-1 Maker-PhantomBreaker lower bound
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.