Problem

Source: China Mathematical Olympiad 2015 Q5

Tags: combinatorics proposed, combinatorics



Given $30$ students such that each student has at most $5$ friends and for every $5$ students there is a pair of students that are not friends, determine the maximum $k$ such that for all such possible configurations, there exists $k$ students who are all not friends.