English

Cayley Graphs Of Order $pqrs$ Are Hamiltonian

Combinatorics 2026-07-16 v1

Abstract

Assume G G is a finite group with order G=pqrs |G| = pqrs , where p p , q q , r r , and s s are distinct prime numbers. We prove that every connected Cayley graph of G G contains a hamiltonian cycle. Our result drops all restrictions of all previously known results on hamiltonian cycles in Cayley graphs of groups of order pqrspqrs.

Keywords

Cite

@article{arxiv.2607.14440,
  title  = {Cayley Graphs Of Order $pqrs$ Are Hamiltonian},
  author = {Florian Lehner and Farzad Maghsoudi and Bobby Miraftab},
  journal= {arXiv preprint arXiv:2607.14440},
  year   = {2026}
}