info prev up next book cdrom email home

Party Problem

Also known as the Maximum Clique Problem. 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.

See also Clique, Ramsey Number

© 1996-9 Eric W. Weisstein