Resumen de An exact minimum degree condition for Hamilton cycles in oriented graphs

Peter Keevash, Daniela Kühn, Deryk Osthus

• We show that every sufficiently large oriented graph G with +(G), �(G)(3n�4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979