arXiv Analytics

Sign in

arXiv:0801.0394 [math.CO]AbstractReferencesReviewsResources

An exact minimum degree condition for Hamilton cycles in oriented graphs

Peter Keevash, Daniela Kühn, Deryk Osthus

Published 2008-01-02, updated 2008-04-10Version 3

We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979.

Comments: revised version
Categories: math.CO
Subjects: 05C45, 05C20, 05C35
Related articles: Most relevant | Search more
arXiv:0907.3358 [math.CO] (Published 2009-07-20, updated 2009-08-06)
Arbitrary Orientations Of Hamilton Cycles In Oriented Graphs
arXiv:0709.1047 [math.CO] (Published 2007-09-07, updated 2008-06-04)
A Dirac type result on Hamilton cycles in oriented graphs
arXiv:2402.03878 [math.CO] (Published 2024-02-06)
The generalizations of Hamiltonian in oriented graphs

Links

Toolbox