Powers of paths in tournaments
Authors:
- 23 March 2021
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 30 (6) , 894-898
Abstract
In this short note we prove that every tournament contains the k-th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also give a complete solution for this problem when k=2, showing that there is always a square of a directed path of length , which is best possible.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Paths with many shortcuts in tournamentsDiscrete Mathematics, 2020
- Proof of the Seymour conjecture for large graphsAnnals of Combinatorics, 1998
- Powers of Hamilton cycles in tournamentsJournal of Combinatorial Theory, Series B, 1990
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952