Strasser’s conjecture on Hamiltonicity of Cayley graphs
Determine whether every connected Cayley graph is Hamiltonian.
References
Conjecture 1.7. Every connected Cayley graph is Hamiltonian.
— Hamiltonicity of expanders: optimal bounds and applications
(2402.06603 - Draganić et al., 2024) in Conjecture 1.7, Section 1.1
Every finite connected Cayley graph on at least 3 vertices is hamiltonian.
— Asymptotic connectivity, hamiltonicity and toughness
(2610.09992 - Georgakopoulos, 7 Oct 2026) in Conjecture (folklore), Section 1, subsection “The main problems”
Is \ weakly hamiltonian?
— Asymptotic connectivity, hamiltonicity and toughness
(2610.09992 - Georgakopoulos, 7 Oct 2026) in Problem, Section 1, subsection “The main problems”
Is \ asymptotically\ hamiltonian?
— Asymptotic connectivity, hamiltonicity and toughness
(2610.09992 - Georgakopoulos, 7 Oct 2026) in Problem, Section 1, subsection “The main problems”
Is it true that if a group $\Gamma$ is the cartesian product of two finite hamiltonian groups, then $\Gamma$ must itself be hamiltonian?
— Asymptotic connectivity, hamiltonicity and toughness
(2610.09992 - Georgakopoulos, 7 Oct 2026) in Problem, Section 1, subsection “The main problems”