Journal article icon

Journal article

Counting Hamilton decompositions of oriented graphs

Abstract:

A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton decomposition of G is a partition of its edge set into disjoint Hamilton cycles. In the late 60s Kelly conjectured that every regular tournament has a Hamilton decomposition. This conjecture was recently settled for large tournaments by Kuhn and Osthus [15], who proved more generally that every r-regular n-vertex oriented graph G (without antiparallel edges) with r = cn for some fixed c >...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1093/imrn/rnx085

Authors


More by this author
Department:
Oxford, MPLS, Mathematical Institute
Sudakov, B More by this author
Publisher:
Oxford University Press Publisher's website
Journal:
International Mathematics Research Notices Journal website
Volume:
2018
Issue:
22
Pages:
6908-6933
Publication date:
2017-05-16
Acceptance date:
2017-03-27
DOI:
EISSN:
1687-0247
ISSN:
1073-7928
Pubs id:
pubs:696631
URN:
uri:046a158e-c3ad-4bf8-ae4d-e297a7b03a92
UUID:
uuid:046a158e-c3ad-4bf8-ae4d-e297a7b03a92
Local pid:
pubs:696631

Terms of use


Metrics



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

TO TOP