CMO 2015 Problem 5
- Day 2
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.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.