Projects per year
Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 144-166 |
| Number of pages | 23 |
| Journal | Journal of the London Mathematical Society |
| Volume | 79 |
| Issue number | 1 |
| Early online date | 5 Dec 2008 |
| DOIs | |
| Publication status | Published - 5 Jan 2009 |
Fingerprint
Dive into the research topics of 'An exact minimum degree condition for Hamilton cycles in oriented graphs'. Together they form a unique fingerprint.Projects
- 2 Finished
-
Directed graphs and the regularity method
Kuhn, D. (Principal Investigator) & Osthus, D. (Co-Investigator)
Engineering & Physical Science Research Council
1/10/07 → 31/03/11
Project: Research Councils
-
Graph expansion and applications
Osthus, D. (Principal Investigator)
Engineering & Physical Science Research Council
1/08/07 → 30/11/09
Project: Research Councils