2016 circles with radius are lying on the plane. Among these circles, show that one can select a collection of circles satisfying the following: either every pair of two circles in intersects or every pair of two circles in does not intersect.
, 2016
Solution
Suppose there do not exist circles such that every pair of circles intersects.
Consider a coordinate plane such that the line joining any pair of centres of the circles is not parallel to the coordinate axes. We label the circles as such that the -coordinate of the centre of is less than that of if .

Consider one of the circles . Let be the circle with radius and having the same centre as . Partition the left semicircle of into sectors of . Then the distance between any two points in the same sector is at most . If there are centres of the other circles belonging to the same sector, then these circles together with satisfy the condition, since the distance between any two of these centres is at most , which shows the two circles intersect. Thus, we may assume there are at most centres in each sector. This implies at most centres among lie in , or equivalently at most of these circles intersect .
Now, we colour the circles one by one in colours. Suppose we have coloured . Since intersects at most of the previous circles, we can colour it in a way such that its colour is different from the colours of all circles among which intersect . By the pigeonhole principle, we can find
circles having the same colour. This means these circles are pairwise disjoint. So we are done.