An exact minimum degree condition for Hamilton cycles in oriented graphs

Abstract

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.

revised version

Cited by in corpus (5)

• Hamilton decompositions of regular expanders: applications
• An approximate version of Sumner's universal tournament conjecture
• Path decompositions of tournaments
• Transversal Hamilton cycles in digraph collections
• Cycle Partitions in Dense Regular Digraphs and Oriented Graphs