An exact minimum degree condition for Hamilton cycles in oriented graphs
  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. 
Peter Keevash, Daniela K\"uhn and Deryk Osthus