Pokrovskiy, A;
(2017)
Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments.
International Mathematics Research Notices
, 2017
(2)
pp. 429-467.
10.1093/imrn/rnw009.
Preview |
Text
Hamiltonian.pdf - Accepted Version Download (535kB) | Preview |
Abstract
Thomassen conjectured that there is a function f(k) such that every strongly f(k)-connected tournament contains k edge-disjoint Hamiltonian cycles. This conjecture was recently proved by Kühn, Lapinskas, Osthus, and Patel who showed that f(k)≤O(k2(logk)2) and conjectured that there is a constant C such that f(k) ≤ Ck2. We prove this conjecture. As a second application of our methods, we answer a question of Thomassen about spanning linkages in highly connected tournaments.
| Type: | Article |
|---|---|
| Title: | Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1093/imrn/rnw009 |
| Publisher version: | https://doi.org/10.1093/imrn/rnw009 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10112661 |
Archive Staff Only
 |
View Item |
