Hamiltonicity conjecture for minimum-degree-three random graphs
Statement
Let be the random graph on vertices with edges, conditioned on having minimum degree at least . Hamiltonicity conjecture. For any , has a Hamilton cycle with high probability as tends to infinity. This conjecture proposes that average degree at least suffices for Hamiltonicity in the random graph conditioned on minimum degree ; the supplied text gives no resolution beyond the preceding result that 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.