Students
Source: Iran TST 2002 (From Lovasz)
September 27, 2006
combinatorics proposedcombinatorics
Problem Statement
A school has students and classes. Every two students in the same class are friends. For each two different classes, there are two people from these classes that are not friends. Prove that we can divide students into parts taht students in each part are not friends.