Problem

Source: 239 2017 J8 S5

Tags: graph theory, combinatorics



A school has three classes. Some pairs of children from different classes are enemies (there are no enemies in a class). It is known that every child from the first class has as many enemies in the second class as in the third; the same is true for other classes. Prove that the number of pairs of children from classes having a common enemy is not less than the number of pairs of children being enemies.