Proof of Lov\'{a}sz conjecture for odd order
Combinatorics
2024-07-31 v3
Abstract
Lov\'{a}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.
Cite
@article{arxiv.2407.00646,
title = {Proof of Lov\'{a}sz conjecture for odd order},
author = {Misa Nakanishi},
journal= {arXiv preprint arXiv:2407.00646},
year = {2024}
}