Georgakopoulos's Hamiltonian-circle conjecture for line graphs

Let GG be a locally finite graph, and let L(G)L(G) denote its line graph. A Hamiltonian circle is a circle in the Freudenthal compactification of L(G)L(G) that contains every vertex of L(G)L(G). Georgakopoulos's conjecture. The line graph L(G)L(G) of every locally finite 44-edge connected graph GG 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

Never refreshed

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.