Hey, I have a question that looks relatively easy, but I'm not too sure how to go about answering this one.
Any help would be greatly appreciated
A group of 15 people is gathered together for a meeting. Show that at least two people must have the same number of acquaintances at the meeting.
Theorem: In any simple graph, , there are at least two vertices with the same degree.