1 problem

Let $k$ be a positive integer. A $k$-edge-coloured finite tournament is a finite tournament whose edges are assigned one of $k$ colours, and a set $S\subseteq V(T)$ is reachable fr…