Problem

Source: 2022 Israel TST 3 P3

Tags: combinatorics, combinatorics unsolved



A class has 30 students. To celebrate 'Tu BiShvat' each student chose some dried fruits out of $n$ different kinds. Say two students are friends if they both chose from the same type of fruit. Find the minimal $n$ so that it is possible that each student has exactly \(6\) friends.