ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex regular graph, and let F∼Gn,2F\sim G_{n,2} be a random 22-regular graph on the same vertex set as GG. Here, G∪FG\cup F denotes the graph formed by adding the edges of FF to GG, and Hamiltonicity conjecture. With high probability, G∪FG\cup F is Hamiltonian. This asks whether the approximate-regularity hypothesis in the cited theorem can be strengthened to regular graphs without any further assumptions; it is presented as an open problem.

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.