Rapaport–Strasser conjecture for Hamilton cycles in connected Cayley graphs

From papers

Let Γ\Gamma be a finite group and let SΓ{1}S\subseteq\Gamma\setminus\{1\} satisfy S=S1S=S^{-1}. The Cayley graph Cay(Γ,S)\operatorname{Cay}(\Gamma,S) has vertex set Γ\Gamma and edges {g,gs}\{g,gs\} for gΓg\in\Gamma and sSs\in S; assume it is connected, equivalently, that SS generates Γ\Gamma. 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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Mengyu Cao, Mei Lu and Xiamiao Zhao, “Matchings and Near-Optimal 2-Factor Packings in Percolated Vertex-Transitive Graphs”, arXiv:2607.20157 (2026).

Solutions 0

No solutions have been posted yet.