Powers of paths in tournaments
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 [2...
主要な著者: | Draganić, N, Dross, F, Fox, J, Girão, A, Havet, F, Korándi, D, Lochet, W, Correia, DM, Scott, A, Sudakov, B |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Cambridge University Press
2021
|
類似資料
-
Oriented Hamiltonian cycles in tournaments
著者:: Havet, F
出版事項: (2000) -
Disjoint paths in tournaments
著者:: Chudnovsky, M, 等
出版事項: (2014) -
Flashes and rainbows in tournaments
著者:: Girão, A, 等
出版事項: (2024) -
Disjoint paths in unions of tournaments
著者:: Chudnovsky, M, 等
出版事項: (2018) -
Tournaments and colouring
著者:: Berger, E, 等
出版事項: (2013)