The Grothendieck constant of a graph is the integrality gap of the canonical semidefinite relaxation of the integer program , replacing variables by unit vectors. We show that when has no ‐minor and girth ; moreover, if the cut polytope of is defined by inequalities supported by at most points; lastly the worst case ratio of clique‐web inequalities is bounded by 3.