Rapaport–Strasser conjecture for Hamilton cycles in connected Cayley graphs

Less than 1 year old · traced to

Let Γ\Gamma be a finite group and let S⊆Γ∖{1}S\subseteq\Gamma\setminus\{1\} satisfy S=S−1S=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 s∈Ss\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.

References

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).

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.