arXiv Analytics

Sign in

arXiv:2203.13460 [math.CO]AbstractReferencesReviewsResources

Hamilton Cycles In Primitive Graphs of Order $2rs$

Shaofei Du, Yao Tian, Hao Yu

Published 2022-03-25Version 1

After long term efforts, it was recently proved in \cite{DKM2} that except for the Peterson graph, every connected vertex-transitive graph of order $rs$ has a Hamilton cycle, where $r$ and $s$ are primes. A natural topic is to solve the hamiltonian problem for connected vertex-transitive graphs of $2rs$. This topic is quite trivial, as the problem is still unsolved even for that of $r=3$. In this paper, it is shown that except for the Coxeter graph, every connected vertex-transitive graph of order $2rs$ contains a Hamilton cycle, provided the automorphism group acts primitively on vertices.

Related articles: Most relevant | Search more
arXiv:1808.08553 [math.CO] (Published 2018-08-26)
Hamilton cycles in vertex-transitive graphs of order a product of two primes
arXiv:2007.08800 [math.CO] (Published 2020-07-17)
Turns in Hamilton cycles of rectangular grids
arXiv:math/0612751 [math.CO] (Published 2006-12-24)
Hamilton cycles in highly connected and expanding graphs