Projects per year
We show that every sufficiently large oriented graph G with delta(+)(G), delta(-)(G) >= (3n - 4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979.
FingerprintDive into the research topics of 'An exact minimum degree condition for Hamilton cycles in oriented graphs'. Together they form a unique fingerprint.
- 2 Finished