# Edge disjoint Hamiltonian cycles in highly connected tournaments

@article{Pokrovskiy2014EdgeDH,
title={Edge disjoint Hamiltonian cycles in highly connected tournaments},
author={A. Pokrovskiy},
journal={arXiv: Combinatorics},
year={2014}
}
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 Kuhn, Lapinskas, Osthus, and Patel who showed that $f(k)\leq O(k^2(\log k)^2)$ and conjectured that there is a constant $C$ such that $f(k)\leq Ck^2$. We prove this conjecture.
8 Citations

#### Figures from this paper

Bipartitions of Highly Connected Tournaments
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2016
Sparse Spanning k-Connected Subgraphs in Tournaments
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2017
Bipartitions of highly connected tournaments
• Mathematics, Computer Science
• Electron. Notes Discret. Math.
• 2015
On 1-factors with prescribed lengths in tournaments
• Mathematics, Computer Science
• J. Comb. Theory, Ser. B
• 2020
• A. Pokrovskiy
• Mathematics, Computer Science
• J. Comb. Theory, Ser. B
• 2015
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
• Mathematics, Computer Science
• Combinatorics, Probability and Computing
• 2016
Cycles and matchings in randomly perturbed digraphs and hypergraphs
• Mathematics, Computer Science
• Electron. Notes Discret. Math.
• 2015
Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs
• Dong Yeap Kang
• Computer Science, Mathematics
• Combinatorics, Probability and Computing
• 2018

#### References

SHOWING 1-10 OF 14 REFERENCES
Bipartitions of Highly Connected Tournaments
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2016
Hamiltonian-connected tournaments
• C. Thomassen
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 1980
A survey on Hamilton cycles in directed graphs
• Computer Science, Mathematics
• Eur. J. Comb.
• 2012