Question 139
Given $n \ge 2$. We call a group of people *n-compact* if for every person of the group one can find *n* people (different from that person) who are acquainted with each other.
Find the maximum possible $N$ such that every *n*-compact group of $N$ people contains a subgroup of $n + 1$ people acquainted with each other.
Find the maximum possible $N$ such that every *n*-compact group of $N$ people contains a subgroup of $n + 1$ people acquainted with each other.