Hamilton Cycles In Primitive Graphs of Order
arXiv:2203.13460
Abstract
After long term efforts, it was recently proved in \cite{DKM2} that except for the Peterson graph, every connected vertex-transitive graph of order has a Hamilton cycle, where and are primes. A natural topic is to solve the hamiltonian problem for connected vertex-transitive graphs of . This topic is quite trivial, as the problem is still unsolved even for that of . In this paper, it is shown that except for the Coxeter graph, every connected vertex-transitive graph of order contains a Hamilton cycle, provided the automorphism group acts primitively on vertices.
22 pages