Skip to Main Content
Theory of Computational Complexity, 2nd Edition
book

Theory of Computational Complexity, 2nd Edition

by Ding-Zhu Du, Ker-I Ko
June 2014
Intermediate to advanced content levelIntermediate to advanced
512 pages
17h 55m
English
Wiley
Content preview from Theory of Computational Complexity, 2nd Edition
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
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Theory of Computation

Theory of Computation

George Tourlakis

Publisher Resources

ISBN: 9781118594971Purchase book