Problem

Source: CMO-1996-4

Tags: combinatorics unsolved, combinatorics



$8$ singers take part in a festival. The organiser wants to plan $m$ concerts. For every concert there are $4$ singers who go on stage, with the restriction that the times of which every two singers go on stage in a concert are all equal. Find a schedule that minimises $m$.