The number of kings in a multipartite tournament (Q1356480)

A multipartite tournament is an orientation of a complete multipartite graph. A vertex \(v\) in a multipartite tournament \(T\) is an \(r\)-king if the distance from \(v\) to any other vertex of \(T\) is at most \(r\). A vertex \(v\) is a transmitter if its indegree equals zero. Let \(T\) be a multipartite tournament with at most one transmitter. It is proved that if \(T\) has no 3-kings, then \(T\) contains at least eight 4-kings. All \(p\)-partite tournaments \((p\geq 3)\) having eight 4-kings and no 3-kings are completely characterized.