MathDB

(299) 6

Part of 1991 Tournament Of Towns

Problems(1)

TOT 299 1991 Spring A S6 15 day tournament for 32 boxers

Source:

6/9/2024
There are 3232 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 1515 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)
combinatorics