Dice Question Streamline Icon: https://streamlinehq.com

Strasser’s conjecture on Hamiltonicity of Cayley graphs

Determine whether every connected Cayley graph is Hamiltonian.

Information Square Streamline Icon: https://streamlinehq.com

Background

Cayley graphs are vertex-transitive and capture algebraic structure via group generators. Strasser (1959) conjectured that all connected Cayley graphs admit Hamilton cycles. While resolved for abelian groups, the general case remains open.

The paper resolves a random version of this conjecture (Theorem 1.8) via spectral expander Hamiltonicity but the full deterministic conjecture remains open.

References

Conjecture 1.7. Every connected Cayley graph is Hamiltonian.

Hamiltonicity of expanders: optimal bounds and applications (2402.06603 - Draganić et al., 9 Feb 2024) in Conjecture 1.7, Section 1.1