Hamilton cycles in vertex-transitive graphs of prime-power order
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
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality