ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected, infinite, locally finite graph. A 2-connected ball of radius 22 is the subgraph induced by the vertices in such a ball that is 2-connected. For a path uwvuwv with uv∉E(G)uv\notin E(G), let dG(u)d_G(u) and dG(v)d_G(v) denote the degrees of its endpoints, and let M2(w)M_2(w) denote the set of vertices at distance at most 22 from ww.

Hamilton-circle conjecture. The graph GG has a Hamilton circle if every ball of radius 22 in GG is 2-connected and

dG(u)+dG(v)≥∣M2(w)∣−1d_G(u)+d_G(v)\geq |M_2(w)|-1

for each path uwvuwv with uv∉E(G)uv\notin E(G).

This conjecture combines local 2-connectivity with a degree condition modeled on the finite Hamiltonicity criterion. The source explicitly says that the authors believe it is true but gives no proof or resolution, so it remains open.

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.