Lower bounds for cube-ideal set-systems

A set-system $S\subseteq \{0,1{\}}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube-ideal set-systems, and linear lower bounds on their VC dimension. We then provide applications to graph theory and combinatorial optimization, specifically to strong orientations, perfect matchings, dijoins, and ideal clutters, including the Lovász-Plummer conjecture.