Georgakopoulos's Hamiltonian-circle conjecture for line graphs
Georgakopoulos's Hamiltonian-circle conjecture for line graphs
Let be a locally finite graph, and let denote its line graph. A Hamiltonian circle is a circle in the Freudenthal compactification of that contains every vertex of . Georgakopoulos's conjecture. The line graph of every locally finite -edge connected graph has a Hamiltonian circle. This conjecture concerns the extension of Hamiltonian-cycle phenomena to infinite locally finite graphs through topological notions in their Freudenthal compactifications; the supplied passage gives no resolution, so its status remains open.
Sources & referencesView supporting material
Primary source
Florian Lehner, “On spanning tree packings of highly edge connected graphs”, arXiv:1109.6787 (2013).
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
Sign in to submit a solution.
No solutions have been posted yet.