We call the tournament T an m-coloured tournament if the arcs of T are coloured with m colours. In this paper we prove that for each n greater than or equal to 6, there exists a 4-coloured tournament T-n of order n satisfying ...