Cut Polytopes of Minor-free Graphs

Markus Chimani, Martina Juhnke-Kubitzke, Alexander Nover +1

The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut po…