ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dgeq1dgeq1 be an integer, let α=α(n)∈(0,1/2)\alpha=\alpha(n)\in(0,1/2), and let HH be an nn-vertex graph with minimum degree at least αn\alpha n. Write Gd(n,r)G^d(n,r) for the random geometric graph generated by nn independent uniform points in [0,1]d[0,1]^d, with edges between points at distance at most rr. Hamiltonicity conjecture. For some constant CC, asymptotically almost surely,

H∪Gd(n,(−Clog⁡α/n)1/d)H\cup G^d(n,(-C\log\alpha/n)^{1/d})

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 CC; the conjecture concerns the regime in which α=α(n)\alpha=\alpha(n) tends to 00.

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.