On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory

[1]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[2]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[3]  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[5]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[6]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[7]  A. Selman.  Structure in Complexity Theory , 1986, Lecture Notes in Computer Science.

[8]  Ron Graham,et al.  Some Recent Developments in Ramsey Theory , 1975 .

[9]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[10]  David Zuckerman,et al.  NP-complete problems have a version that's hard to approximate , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[11]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.