Hamilton-circle conjecture from 2-connected radius-two balls
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.
References
4 papers in this index state this conjecture (2011–2018). The statement above is taken from the most recent of them; the others are arXiv:1708.03476, arXiv:1609.01119, arXiv:1102.2087.
Source: Armen S. Asratian, Jonas B. Granholm and Nikolay K. Khachatryan, “Some local–global phenomena in locally finite graphs”, arXiv:1810.07023 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.