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/logn). 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.
Original language | English (US) |
---|---|
Pages (from-to) | 177-183 |
Number of pages | 7 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 61 |
DOIs | |
State | Published - Aug 2017 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Keywords
- Random tournament
- Size Ramsey number
- directed paths
- edge colouring