$100$ people are at a party, and each is friends with at most $10$ of the other guests. Determine the greatest $n$ for which there must exist a set of $n$ guests such that no two of them are friends.