The inequicut cone (Q688255): Difference between revisions

A family \({\mathcal F}\subset 2^ E\) of subsets of a finite set \(E\), viewed as a set of vertices of the hypercube in \(R^ E\), leads often to important polytopes \(P({\mathcal F}):= \text{conv}({\mathcal F})\) or convex cones \(K({\mathcal F}):= \text{cone}({\mathcal F})\) linking `Combinatorics of finite sets' and `Geometry of convex polytopes'. Let \(E= K_ n\) be the complete graph and \(\mathcal F\) a family of cuts in \(K_ n\), where the cut \(\delta(S)\) associated with \(S\subset [n]\) is the collection of all edges having exactly one endnode in \(S\). Depending on the size of \(S\) one also defines equicuts and the inequicuts of \(K_ n\) and the corresponding cones (polytopes) are \(C_ n\), \(IC_ n\) and \(EP_ n\). It is shown that all facets of \(C_ n\) are inherited in a precise sense by some \(IC_ m\) and \(EP_ m\). Not all facets arise this way. Several new classes of facets (triangular, domino, butterfly etc.) are described for \(IC_ n\) and a complete facial structure is given for \(n\leq 7\).