2014 Combinatorics #7: Tournament Outcomes
Source:
February 23, 2014
countingdistinguishability
Problem Statement
Six distinguishable players are participating in a tennis tournament. Each player plays one match of tennis against every other player. The outcome of each tennis match is a win for one player and a loss for the other players; there are no ties. Suppose that whenever and are players in the tournament for which won (strictly) more matches than over the course of the tournament, it is also the case that won the match against during the tournament. In how many ways could the tournament have gone?