Hamiltonicity conjecture for randomly perturbed graphs with geometric randomness
Statement
Let be an integer, let , and let be an -vertex graph with minimum degree at least . Write for the random geometric graph generated by independent uniform points in , with edges between points at distance at most . Hamiltonicity conjecture. For some constant , asymptotically almost surely,
is Hamiltonian. This would extend the known threshold for binomial random perturbations to random geometric graphs and would be best possible up to the value of ; the conjecture concerns the regime in which tends to .
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.