论文标题
比赛中的道路力量
Powers of paths in tournaments
论文作者
论文摘要
在此简短说明中，我们证明每场比赛都包含有线长度的$ K $ TH $ th。这取决于Yuster和Girão的最新结果。当$ k = 2 $时，我们还为此问题提供了一个完整的解决方案，这表明总是有一个定向路径的正方形$ \ lceil 2n/3 \ rceil-1 $，这是最好的。
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 $\lceil 2n/3 \rceil-1$, which is best possible.
