Kings in k-partite tournaments

Abstract We prove that every k -partite tournament with at most one vertex of in-degree zero contains a vertex from which each other vertex can be reached in at most four steps.