Strong subtournaments and cycles of multipartite tournaments

In this paper we relate the global irregularity and the order of a cc-partite tournament TT to the existence of certain cycles and the problem of finding the maximum strongly connected subtournament of TT. In particular, we give results related to the following problem of Volkmann: How close to regular must a cc-partite tournament be, to secure a strongly connected subtournament of order cc?