MathDB
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 AA and BB are players in the tournament for which AA won (strictly) more matches than BB over the course of the tournament, it is also the case that AA won the match against BB during the tournament. In how many ways could the tournament have gone?