Graph with no K_5
Source: China Mathematical Olympiad 2015 Q5
December 21, 2014
combinatorics proposedcombinatorics
Problem Statement
Given students such that each student has at most friends and for every students there is a pair of students that are not friends, determine the maximum such that for all such possible configurations, there exists students who are all not friends.