O'Reilly logo

Theory of Computational Complexity, 2nd Edition by Ker-I Ko, Ding-Zhu Du

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

GENERALIZED RAMSEY NUMBER (GRN): Given a complete graph c03-math-0669 with its edges partially two colored (i.e., it has a function c03-math-0670), and given an integer K > 0, determine whether it is true that for any two-colored restriction c03-math-0672 of c (i.e., c03-math-0674 for all c03-math-0675 and c03-math-0676 whenever c03-math-0677), there is a monochromatic clique in G of size K.

Theorem 3.15

Proof

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required