Problem

Source:

Tags: combinatorics



It was noted that during one day in a town, each person made at most one phone call. Prove that the people in the town can be divided into three groups such that no two persons in the same group talked by phone that day.