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...
Main Authors: | Draganić, N, Dross, F, Fox, J, Girão, A, Havet, F, Korándi, D, Lochet, W, Correia, DM, Scott, A, Sudakov, B |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado: |
Cambridge University Press
2021
|
Títulos similares
-
Oriented Hamiltonian cycles in tournaments
por: Havet, F
Publicado: (2000) -
Disjoint paths in tournaments
por: Chudnovsky, M, et al.
Publicado: (2014) -
Flashes and rainbows in tournaments
por: Girão, A, et al.
Publicado: (2024) -
Disjoint paths in unions of tournaments
por: Chudnovsky, M, et al.
Publicado: (2018) -
Tournaments and colouring
por: Berger, E, et al.
Publicado: (2013)