2.18 A football league consists of 18 teams playing a round-robin tournament, meaning each round the 18 teams are divided into 9 pairs, and each pair plays one match. In the next round, the teams are re-grouped to play again, for a total of 17 rounds, ensuring that each team plays against each of the other 17 teams exactly once. After playing rounds according to any feasible schedule, there always exist 4 teams that have played a total of only one match among themselves. Find the maximum possible value of .
Solution
First, construct a tournament scheme: number the 18 teams sequentially as , and form two subsets according to odd and even numbers:
Then, the teams for each match are assigned to rounds based on the remainder when is divided by 9. First, arrange 4 matches between teams of the same parity, then arrange one match for the "odd team out," requiring that in the -th round, each match's teams satisfy:
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.