Friend/Stranger graph
Source: 239 2009 J3
July 29, 2020
combinatorics
Problem Statement
The company has people. For any , we can find a group of people such that there are two (different from them) strangers, each of them knows all of these people. At what maximum is this possible?