On hamiltonian cycles in Cayley graphs of order pqrs
Dave Witte Morris

TL;DR
This paper proves that all connected Cayley graphs of groups with order equal to the product of four distinct odd primes contain a Hamiltonian cycle, extending understanding of Hamiltonian properties in Cayley graphs.
Contribution
It establishes that for groups of order pqrs with distinct odd primes, every connected Cayley graph has a Hamiltonian cycle, a new result in algebraic graph theory.
Findings
All connected Cayley graphs of groups of order pqrs have Hamiltonian cycles.
The result applies to groups with four distinct odd prime factors.
Supports conjectures about Hamiltonian cycles in Cayley graphs of finite groups.
Abstract
Let be a finite group. We show that if , where , , , and are distinct odd primes, then every connected Cayley graph on has a hamiltonian cycle.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Limits and Structures in Graph Theory
