Question

In a round-robin tournament, every two distinct players play against each other just once. For a round-robin tournament with no tied games, a record of who beat whom can be described with a tournament digraph, where the vertices correspond to players and there is an edge x→yx→y iff xx beat yy in their game.
A ranking is a path that includes all the players. So in a ranking, each player won the game against the next lowest ranked player, but may very well have lost their games against much lower ranked players —whoever does the ranking may have a lot of room to play favorites.

Prove that every finite tournament digraph has a ranking. Thanks!

Answer 1

Answer: Ranking game

Explanation: XX and YY

definitely we can X+Y........1

We can have Y+X ..............2

So for the player that wins we would name it ----A

So for the loser, we would have B..........

So to connect the Winner and Loser the equation = A+B 0r A-B