Abstract

AbstractWe 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call