Counting Hamilton Decompositions of Oriented Graphs

DOI10.1093/imrn/rnx085zbMath1420.05143arXiv1609.09550OpenAlexW2963220735MaRDI QIDQ5233804

Eoin Long, Asaf Ferber, Benjamin Sudakov

Publication date: 9 September 2019

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.09550

zbMATH Keywords

tournamentstravelling salesman problemHamilton cyclesHamilton decompositionrobust expanders

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Path decompositions of tournaments ⋮ Number of 1-factorizations of regular high-degree graphs ⋮ An approximate version of Jackson’s conjecture

This page was built for publication: Counting Hamilton Decompositions of Oriented Graphs