Problem

Source: Middle Europe Mathematical Olympiad 2009 TST First Day Second problem

Tags: induction, graph theory, combinatorics unsolved, combinatorics



On sport games there was 1991 participant from which every participant knows at least n other participants(friendship is mutual). Determine the lowest possible n for which we can be sure that there are 6 participants between which any two participants know each other.