Another way to think about Ramsey theory involves the so-called party problem. For example, what is the smallest party that is guaranteed to have either at least 3 attendees who are (pairwise) mutual strangers or at least 3 of them who are (pairwise) mutual acquaintances? The answer is 6. Determining the party size necessary to ensure the presence of at least 4 mutual friends or at least 4 mutual strangers is much more difficult, and solutions for higher party sizes may never be known.