|
|||||
|
|
Monochromatic paths in random tournaments |
|
| Authors: | Matija Buci&#x; Shoham Letzter Benny Sudakov |
| Institution: | Matija Bucić,Shoham Letzter,Benny Sudakov |
| Abstract: | We prove that, with high probability, any 2‐edge‐coloring of a random tournament on n vertices contains a monochromatic path of length  . This resolves a conjecture of Ben‐Eliezer, Krivelevich, and Sudakov and implies a nearly tight upper bound on the oriented size Ramsey number of a directed path. |
| Keywords: | monochromatic directed path monochromatic oriented path Ramsey theory size Ramsey number |