Rapaport–Strasser conjecture for Hamilton cycles in connected Cayley graphs
Let be a finite group and let satisfy . The Cayley graph has vertex set and edges for and ; assume it is connected, equivalently, that generates . A Hamilton cycle is a cycle containing every vertex of the graph.
Rapaport–Strasser conjecture. Every connected Cayley graph on a finite group with at least three elements has a Hamilton cycle.
The conjecture is known for finite abelian groups and for several dense classes of Cayley graphs, but the full conjecture remains open.
References
- Mengyu Cao, Mei Lu and Xiamiao Zhao, “Matchings and Near-Optimal 2-Factor Packings in Percolated Vertex-Transitive Graphs”, arXiv:2607.20157 (2026).
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.