ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gn,cnG_{n,cn} be the random graph on nn vertices with cncn edges, conditioned on having minimum degree at least 33. Hamiltonicity conjecture. For any c≥3/2c\geq 3/2, Gn,cnG_{n,cn} has a Hamilton cycle with high probability as nn tends to infinity. This conjecture proposes that average degree at least 33 suffices for Hamiltonicity in the random graph conditioned on minimum degree 33; the supplied text gives no resolution beyond the preceding result that 128n128n edges suffice.

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.