MathDB
Poland 4

Source: IMO LongList 1959-1966 Problem 24

September 2, 2004
graph theorycombinatoricsIMO ShortlistIMO Longlistvertex degree

Problem Statement

There are n2n\geq 2 people at a meeting. Show that there exist two people at the meeting who have the same number of friends among the persons at the meeting. (It is assumed that if AA is a friend of B,B, then BB is a friend of A;A; moreover, nobody is his own friend.)