Sharp threshold conjectures for Maker's matching and Hamiltonian cycle games
Statement
Let be the evolving random graph process, and write for the hitting time at which event first occurs. Let be the perfect matching game and the Hamiltonian cycle game. Sharp threshold conjectures for Maker's matching and Hamiltonian cycle games.
and
These conjectures propose sharp hitting-time thresholds for Maker's wins in the perfect matching and Hamiltonian cycle games. The surrounding discussion notes that the connectivity game has an established sharp threshold, while these stronger assertions for the matching and Hamiltonian games are posed as open questions.
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.