Partitioning a city into three groups with no internal calls

On a certain day, each resident of a city made at most one phone call.

Prove that the population of the city can be partitioned into at most three groups such that no two people within the same group spoke to each other by phone on that day.