Proof of Lovász conjecture for odd order

2024/06/30 by Nakanishi, Misa
#05C45 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2407.00646

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.

Related

• Towards the Lovász conjecture via sublinear expanders
• On Hamilton cycles in graphs defined by intersecting set systems
• Hamilton cycles in vertex-transitive graphs of order a product of two\n primes
• On a conjecture concerning vertex-transitive graphs
• Hamiltonicity of Vertex-Transitive Graphs of Order 4p