Hamilton cycles in vertex-transitive graphs of prime-power order

arXiv:2611.13415 · math.CO · Submitted 2026-11-10 · Read on arXiv

math.CO

Submitted: 2026-11-10

Updated: 2026-11-10

License: http://creativecommons.org/licenses/by/4.0/

The gist: A graph is vertex-transitive if, for any two vertices, there is an automorphism mapping one to the other.

Abstract

A graph is vertex-transitive if, for any two vertices, there is an automorphism mapping one to the other. We prove that every connected vertex-transitive graph of order p n, where p is a prime and p n at least 3, has a hamiltonian cycle. Our main tool extends Witte's theorem [JCTB (1986)] on Cayley digraphs of p-groups.

Sources

Related papers