Subgraph Polytopes and Independence Polytopes of Count Matroids

Michele Conforti, Volker Kaibel, Matthias Walter +1

Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset…