Hamilton Cycles In Primitive Graphs of Order 2rs
Abstract
After long term efforts, it was recently proved in 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.