Computing the Grothendieck constant of some graph classes

  • Laurent M
  • Varvitsiotis A
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 2

    Citations

    Citations of this article.

Abstract

The Grothendieck constant κ(G) of a graph G=([n],E) is the integrality gap of the canonical semidefinite relaxation of the integer program maxx∈±1n∑ij∈Ewijxi·xj, replacing ±1 variables by unit vectors. We show that κ(G)=g(g-2)cos(πg)≤32 when G has noK5-minor and girth g; moreover, κ(G)≤κ(Kk) if the cut polytope of G is defined by inequalities supported by at most k points; lastly the worst case ratio of clique-web inequalities is bounded by 3. © 2011 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Clique-web inequality
  • Cut polytope
  • Elliptope
  • Grothendieck constant

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free