Hamilton cycles in dense vertex-transitive graphs release_eybm5dxcrba6xac7vkpxidqgp4

by Demetres Christofides, Jan Hladký, András Máthé

Released as a article .

2014  

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.
In text/plain format

Archived Files and Locations

application/pdf  513.3 kB
file_cng7gxfjebg3tkt2goyo2sxr6q
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2014-04-26
Version   v4
Language   en ?
arXiv  1008.2193v4
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 36766b35-f815-484c-81a7-06b67ae6be6f
API URL: JSON