Journal article icon

Journal article

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.

Actions


Access Document


Publisher copy:
10.1112/jlms/jdn065

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Mathematical Inst
Role:
Author
Journal:
Journal of the London Mathematical Society
Volume:
79
Issue:
1
Pages:
144-166
Publication date:
2008-01-02
DOI:
EISSN:
1469-7750
ISSN:
0024-6107
URN:
uuid:d4dcb970-f5b2-446a-a229-733ce04bd09d
Source identifiers:
430653
Local pid:
pubs:430653
Language:
English
Keywords:

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP