Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777070 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
We prove that, with high probability, any 2-edge colouring of a random tournament on n vertices contains a monochromatic path of length Ω(n/logâ¡n). 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Matija BuciÄ, Shoham Letzter, Benny Sudakov,