King-serf duo by monochromatic paths in k-edge-coloured tournaments

Kristóf Bérczi, Attila Joó

An open conjecture of Erdős states that for every positive integer $k$ there is a (least) positive integer $f(k)$ so that whenever a tournament has its edges colored with $k$ color…