e decide that the top ranked player should always be some node whose out-degree in the directed graph is maximum. We motivate this claim by proving that if player i has maximum degree, then for every other player j either i beat j, or i beat some player k which beat j. Prove this claim