Hamilton-circle conjecture from 2-connected radius-two balls
Statement
Let be a connected, infinite, locally finite graph. A 2-connected ball of radius is the subgraph induced by the vertices in such a ball that is 2-connected. For a path with , let and denote the degrees of its endpoints, and let denote the set of vertices at distance at most from .
Hamilton-circle conjecture. The graph has a Hamilton circle if every ball of radius in is 2-connected and
for each path with .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.