Extension Complexity of the Correlation Polytope

06/01/2018

∙

by   Pierre Aboulker, et al.

∙

0

∙

share

We prove that for every n-vertex graph G, the extension complexity of the correlation polytope of G is 2^O(tw(G) + n), where tw(G) is the tree-width of G. We also prove that this bound is tight for graphs contained in minor-closed classes.