A lower bound on the size of an absorbing set in an arc-coloured tournament

Laurent Beaudou, Luc Devroye, Gena Hahn

Bousquet, Lochet and Thomassé recently gave an elegant proof that for any integer $n$, there is a least integer $f(n)$ such that any tournament whose arcs are coloured with $n$ col…