MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $K(G)$ be the Grothendieck constant of a graph with adjacency matrix $A$. How is $K(G)$ precisely related to approximation limits for some standard NP complete problems such as Chromatic, Independence and Clique number approximation?

share|cite|improve this question
Do you know the survey by Khot and Naor? It seems that you should find answers to your question there. – Mikael de la Salle Jul 12 '12 at 8:01
This is a good reference. Thankyou. – Turbo Jul 12 '12 at 8:03

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.