On the 3-kings and 4-kings in multipartite tournaments (Q2433727)

A node \(v\) in a directed graph is a \(k\)-king if the distance from \(v\) to any other node is at most \(k\). Let \(T\) be an \(n\)-partite tournament, where \(n\geq 3\), with no transmitters. The author shows, among other things, that if \(T\) has no 3-kings then it must have at least eight 4-kings; furthermore, if the 4-kings of \(T\) belong to \(r\) partite sets of \(T\) and \(r\geq 3\), then \(T\) has at least \((r+8)\) 4-kings.