Path decompositions of tournaments
DOI10.1112/plms.12480zbMath1521.05055arXiv2010.14158OpenAlexW4317433886MaRDI QIDQ6075058
António Girão, Bertille Granet, Allan Lo, Deryk Osthus, Daniela Kühn
Publication date: 20 September 2023
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.14158
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of packing and covering (05B40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Hamiltonian degree sequences in digraphs
- The linear arboricity of graphs
- Path numbers of tournaments
- An upper bound on the path number of a digraph
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs
- The robust component structure of dense regular graphs and applications
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
- Decomposing tournaments into paths
- Path decompositions of digraphs
- Counting Hamilton Decompositions of Oriented Graphs
- Cycle packing
This page was built for publication: Path decompositions of tournaments
