The existence and uniqueness of strong kings in tournaments (Q2427527): Difference between revisions

The purpose of this paper is to show that for a tournament on n players there exist exactly \(k\) strong kings, \(0 < k < n + 1\), with the following exceptions: \(k = n - 1\) when n is odd and \(k = n\) when \(n\) is even, where a king in a tournament is a player who beats any other player directly or indirectly through a third player. The paper also determines completely the uniqueness of tournaments.