Hamilton Cycles In Primitive Graphs of Order 2rs

DOI10.26493/1855-3974.2930.8E4MaRDI QIDQ6394666arXivFDO

Authors Shaofei Du, Yao Tian, Hao Yu

Publication date 25 March 2022

Published in arXiv

Full work available at URL https://doi.org/10.26493/1855-3974.2930.8E4

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

arXiv classification

math.CO

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 $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.

This page was built for publication: Hamilton Cycles In Primitive Graphs of Order $2rs$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6394666)