%0 Journal Article
%T An exact minimum degree condition for Hamilton cycles in oriented graphs
%A Peter Keevash
%A Daniela K¨¹hn
%A Deryk Osthus
%J Mathematics
%D 2008
%I arXiv
%R 10.1112/jlms/jdn065
%X 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.
%U http://arxiv.org/abs/0801.0394v3