TW-TST 1999 Problem 3
There are people participating in an exhibition. Among any people there are two who don't know each other. Prove that there are people, each of whom knows at most people.
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.