Almost regular image-partite tournaments contain a strong subtournament of order image when image Original Research Article

An orientation of a complete graph is a tournament, and an orientation of a complete image-partite graph is a image-partite tournament. If image is a vertex of a digraph image, then we denote by image and image the outdegree and the indegree of image, respectively. The global irregularity of a digraph image is defined by image over all vertices image and image of image (including image). If image, then image is regular and if image, then image is called almost regular. In 1999, L. Volkmann showed that, if image is an almost regular image-partite tournament with image, then image contains a strongly connected subtournament of order image for every image and he conjectured that this also holds for image, if image. In this paper, we settle this conjecture in affirmative.