TOT 290 1991 Spring A J6 10 day tournament for 16 boxers
Source:
June 9, 2024
combinatorics
Problem Statement
There are 16 boxers in a tournament. Each boxer can fight no more often than once per day. It is known that the boxers are of different strength, and the stronger man always wins. Prove that a 1 day tournament can be organised so as to determine their classification (put them in the order of strength). The schedule of fights for each day is fixed on the evening before and cannot be changed during the day. (A. Andjans, Riga)