Hamilton cycles in dense vertex-transitive graphs
Combinatorics
2017-07-31 v4 Group Theory
Abstract
A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such graphs contain a Hamilton cycle and moreover we provide a polynomial time algorithm for finding such a cycle.
Keywords
Cite
@article{arxiv.1008.2193,
title = {Hamilton cycles in dense vertex-transitive graphs},
author = {Demetres Christofides and Jan Hladký and András Máthé},
journal= {arXiv preprint arXiv:1008.2193},
year = {2017}
}
Comments
26 pages, 3 figures; referees' comments incorporated; accepted for publication in Journal of Combinatorial Theory, series B