In:
Combinatorics, Probability and Computing, Cambridge University Press (CUP), Vol. 30, No. 6 ( 2021-11), p. 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.
Type of Medium:
Online Resource
ISSN:
0963-5483
,
1469-2163
DOI:
10.1017/S0963548321000067
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
2021
detail.hit.zdb_id:
1481145-5
SSG:
17,1