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)