Before tackling the proof let us rephrase the problem in graph-theoretic terms. We interpret the people as the set of vertices V and join two vertices by an edge if the corresponding people are friends. We tacitly assume that friendship is always two-ways, that is, if u is a friend of v, then v is also a friend of u, and further that nobody is his or her own friend.
Unable to display preview. Download preview PDF.