The company has $100$ people. For any $k$, we can find a group of $k$ people such that there are two (different from them) strangers, each of them knows all of these $k$ people. At what maximum $k$ is this possible?
Source: 239 2009 J3
Tags: combinatorics
The company has $100$ people. For any $k$, we can find a group of $k$ people such that there are two (different from them) strangers, each of them knows all of these $k$ people. At what maximum $k$ is this possible?