ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be the evolving random graph process, and write τ(E)\tau(\mathcal E) for the hitting time at which event E\mathcal E first occurs. Let M{\cal M} be the perfect matching game and H{\cal H} the Hamiltonian cycle game. Sharp threshold conjectures for Maker's matching and Hamiltonian cycle games.

τ(Maker wins M)=τ(δ(G)≥2),\tau(\text{Maker wins }{\cal M})=\tau(\delta(G)\geq 2),

and

τ(Maker wins H)=τ(δ(G)≥4).\tau(\text{Maker wins }{\cal H})=\tau(\delta(G)\geq 4).

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 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.