TUYMAADA 2018 S7
A school has three senior classes of students each. Every student knows at least people in each of the other two classes. Prove that the school can send non-intersecting teams to the olympiad so that each team consists of students from different classes who know each other.
Proposed by C. Magyar, R. Martin
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.