Friends and Strangers in Graph Theory

Suppose there are at least six people at a party. If two of them have met before, we call them “friends,” and if two of them have not met before, we call them “strangers.” In an amazing twist of fate, it turns out that there will always exist three people who are pairwise all friends or pairwise all strangers, no matter what the relationships are between the people at the party.