Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Draganić et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: