Proof of Lovász conjecture for odd order

Abstract

Lovász conjectured that every connected vertex-transitive graph contains a hamilton path in 1970. First we reveal the structure of connected vertex-transitive graphs with an odd number of vertices. Then we prove that every connected vertex-transitive graph with an odd number of vertices is hamiltonian.