There are n people in a city, and each of them has exactly 1000 friends (friendship is always symmetric). Prove that it is possible to select a group S of people such that at least 2017n persons in S have exactly two friends in S. imc 2017IMCcombinatoricsapproximationProbabilistic Method