Hamilton decompositions of regular tournaments
From MaRDI portal
Publication:3577676
DOI10.1112/PLMS/PDP062zbMath1221.05179arXiv0908.3411OpenAlexW3105339626MaRDI QIDQ3577676
Daniela Kühn, Deryk Osthus, Andrew Treglown
Publication date: 22 July 2010
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.3411
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (10)
Packing tight Hamilton cycles in 3-uniform hypergraphs ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Hamilton cycles in sparse robustly expanding digraphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Decomposing locally semicomplete digraphs into strong spanning subdigraphs ⋮ Hamilton decompositions of regular expanders: applications ⋮ Edge-disjoint Hamilton cycles in graphs ⋮ Automorphism groups of Walecki tournaments with zero and odd signatures ⋮ An approximate version of Jackson’s conjecture ⋮ Approximate Hamilton decompositions of random graphs
This page was built for publication: Hamilton decompositions of regular tournaments
