Diestel's Hamilton-circle conjecture for locally finite graphs
Statement
Let ) be a connected, infinite, locally finite graph. For vertices forming a path with , write for the neighborhood of and for its degree.
Diestel's conjecture. The graph has a Hamilton circle if
for each such path .
This conjecture extends the finite condition of Asratian and Khachatryan to infinite locally finite graphs, replacing Hamilton cycles by Hamilton circles. The source gives no resolution, so the conjecture 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.