Georgakopoulos–Mohar conjecture on Hamilton circles in planar Cayley graphs
Let be a finitely generated 3-connected planar Cayley graph. A Hamilton circle is a homeomorphic image of in the Freudenthal compactification of the graph that contains every vertex. Georgakopoulos–Mohar conjecture. Every finitely generated 3-connected planar Cayley graph admits a Hamilton circle.
References
Status
- Solved: Agelos Georgakopoulos and Bojan Mohar. Hamilton circles in planar Cayley graphs (Journal of Combinatorial Theory, Series B, 2015) https://api.crossref.org/works?query.title=Hamilton%20circles%20in%20planar%20Cayley%20graphs
Source: Babak Miraftab and Tim Rühmann, “From cycles to circles in Cayley graphs”, arXiv:1708.03476 (2017).
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.