On monochromatic paths and monochromatic cycles in edge coloured tournaments (Q1923509)

The author gives various conditions sufficient to ensure that a tournament whose arcs are \(m\)-coloured has a node \(v\) such that for every other node \(x\) there is a monochromatic path from \(x\) to \(v\). One such condition is that each directed cycle of length at most four is quasi-monochromatic, i.e., with at most one exception its arcs all have the same colour.