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.
Main Authors: | , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2008
|