|
|
|
Also known as the Maximum Clique Problem. Find the minimum number of guests that must be invited so that at
least 
will know each other or at least 
will not know each other. The solutions are known as Ramsey
Numbers.
See also Clique, Ramsey Number