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.
No takes yet. Share an insight, caveat, or question.
A 2008 study studied this question.