Abstract

The Grothendieck constant κ ( G ) of a graph G = ( [ n ] , E ) is the integrality gap of the canonical semidefinite relaxation of the integer program max x ∈ { ± 1 } n ∑ i j ∈ E w i j x i ⋅ x j , replacing ± 1 variables by unit vectors. We show that κ ( G ) = g / ( g − 2 ) cos ( π / g ) ≤ 3 / 2 when G has no K 5 -minor and girth g ; moreover, κ ( G ) ≤ κ ( K k ) 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.