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?

Do you know the survey arxiv.org/abs/1108.2464 by Khot and Naor? It seems that you should find answers to your question there.
– Mikael de la SalleJul 12 '12 at 8:01

This is a good reference. Thankyou.
– TurboJul 12 '12 at 8:03