On Ramsey-Turán type problems in tournaments (Q1071781)

For any r-colouring c of a tournament T, let R(T,c) denote the directed graph whose nodes are the nodes of T and which contains the directed edge \(^{\to}\) if and only if there is a monochromatic path from u to v in T. The authors investigate properties of the graph R(T,c). They show, for example, that for every pair of positive integers r and s there exists a tournament T such that R(T,c) contains a complete directed subgraph with s nodes for every r-colouring c.