maximum clique problem

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at least n will not know each other. The solutions are known as Ramsey numbers.

clique | cocktail party graph | glove problem | handshake problem | Ramsey number