ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a,ba,b be positive integers such that b2a>1\frac{b}{2a}>1 is an integer. In the (a:b)(a:b) mindegree-1 Maker-PhantomBreaker game on E(Kn)E(K_n), 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

(1−o(1))((b2a)!)−1.(1-o(1))\left(\left(\frac{b}{2a}\right)!\right)^{-1}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.