Buchumschlag

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 , w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Draganić, Nemanja (VerfasserIn) , Dross, François (VerfasserIn) , Fox, Jacob (VerfasserIn) , Girao, Antonio (VerfasserIn) , Havet, Frédéric (VerfasserIn) , Korándi, Dániel (VerfasserIn) , Lochet, William (VerfasserIn) , Correia, David Munhá (VerfasserIn) , Scott, Alex (VerfasserIn) , Sudakov, Benny (VerfasserIn)
Dokumenttyp: Article (Journal)
Sprache:Englisch
Veröffentlicht: 23 March 2021
In: Combinatorics, probability & computing
Year: 2021, Jahrgang: 30, Heft: 6, Pages: 894-898
ISSN:1469-2163
DOI:10.1017/S0963548321000067
Online-Zugang:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1017/S0963548321000067
Verlag, lizenzpflichtig, Volltext: https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/powers-of-paths-in-tournaments/3CA48CC1DB5AA4C7A2BB4F9F056A6933
Volltext
Verfasserangaben:Nemanja Draganić, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex Scott and Benny Sudakov
Beschreibung
Zusammenfassung: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.
Beschreibung:Gesehen am 04.05.2022
Beschreibung:Online Resource
ISSN:1469-2163
DOI:10.1017/S0963548321000067

Ähnliche Einträge