Path decompositions of tournaments
Authors:
Open Access
- 19 January 2023
- journal article
- research article
- Published by Wiley in Proceedings of the London Mathematical Society
- Vol. 126 (2) , 429-517
Abstract
No abstract availableAll Related Versions
Funding Information
- Horizon 2020 Framework Programme (786198)
- Engineering and Physical Sciences Research Council (EP/N019504/1, EP/S00100X/1)
This publication has 15 references indexed in Scilit:
- Cycle packingRandom Structures & Algorithms, 2014
- Hamilton decompositions of regular expanders: ApplicationsJournal of Combinatorial Theory, Series B, 2014
- Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournamentsAdvances in Mathematics, 2013
- Approximate Hamilton Decompositions of Robustly Expanding Regular DigraphsSIAM Journal on Discrete Mathematics, 2013
- Hamiltonian degree sequences in digraphsJournal of Combinatorial Theory, Series B, 2010
- An exact minimum degree condition for Hamilton cycles in oriented graphsJournal of the London Mathematical Society, 2008
- The linear arboricity of graphsIsrael Journal of Mathematics, 1988
- An upper bound on the path number of a digraphJournal of Combinatorial Theory, Series B, 1977
- Path numbers of tournamentsJournal of Combinatorial Theory, Series B, 1976
- Path decompositions of digraphsBulletin of the Australian Mathematical Society, 1974