An exact minimum degree condition for Hamilton cycles in oriented graphs

P Keevash; Daniela Kuhn; Deryk Osthus

doi:10.1112/jlms/jdn065

An exact minimum degree condition for Hamilton cycles in oriented graphs

Mathematics

Research output: Contribution to journal › Article › peer-review

26 Citations (Scopus)

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	https://doi.org/10.1112/jlms/jdn065
Publication status	Published - 5 Jan 2009

Access to Document

10.1112/jlms/jdn065

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

Cite this

@article{7ba77e38e8c04da794edbbc173d1c194,

title = "An exact minimum degree condition for Hamilton cycles in oriented graphs",

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.",

author = "P Keevash and Daniela Kuhn and Deryk Osthus",

year = "2009",

month = jan,

day = "5",

doi = "10.1112/jlms/jdn065",

language = "English",

volume = "79",

pages = "144--166",

journal = "Journal of the London Mathematical Society",

issn = "1469-7750",

publisher = "London Mathematical Society",

number = "1",

}

TY - JOUR

T1 - An exact minimum degree condition for Hamilton cycles in oriented graphs

AU - Keevash, P

AU - Kuhn, Daniela

AU - Osthus, Deryk

PY - 2009/1/5

Y1 - 2009/1/5

N2 - 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.

AB - 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.

U2 - 10.1112/jlms/jdn065

DO - 10.1112/jlms/jdn065

M3 - Article

SN - 1469-7750

VL - 79

SP - 144

EP - 166

JO - Journal of the London Mathematical Society

JF - Journal of the London Mathematical Society

IS - 1

ER -

An exact minimum degree condition for Hamilton cycles in oriented graphs

Abstract

Access to Document

Fingerprint

Projects

Directed graphs and the regularity method

Graph expansion and applications

Cite this