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
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 377.1KB)
-
- Publisher copy:
- 10.1093/imrn/rnx085
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Bibliographic Details
- 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
- Source identifiers:
-
696631
Item Description
- Pubs id:
-
pubs:696631
- UUID:
-
uuid:046a158e-c3ad-4bf8-ae4d-e297a7b03a92
- Local pid:
- pubs:696631
- Deposit date:
- 2017-05-20
Terms of use
- Copyright holder:
- Long et al
- Copyright date:
- 2017
- Notes:
- © The Author(s) 2017. Published by Oxford University Press. All rights reserved. This is the accepted manuscript version of the article. The final version is available online from Oxford University Press at: http://dx.doi.org/10.1093/imrn/rnx085
If you are the owner of this record, you can report an update to it here: Report update to this record