All facets of the cut cone \(C_ n\) for \(n=7\) are known
From MaRDI portal
Publication:1813725
DOI10.1016/S0195-6698(13)80064-9zbMath0737.05074MaRDI QIDQ1813725
Publication date: 25 June 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items (14)
Application of cut polyhedra. I ⋮ The cut cone,L1 embeddability, complexity, and multicommodity flows ⋮ New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities ⋮ Generalized cut and metric polytopes of graphs and simplicial complexes ⋮ Small bipartite subgraph polytopes ⋮ The Hilbert basis of the cut cone over the complete graph K 6 ⋮ A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems ⋮ Generating facets for the cut polytope of a graph by triangular elimination ⋮ The real positive semidefinite completion problem for series-parallel graphs ⋮ The hypermetric cone and polytope on eight vertices and some generalizations ⋮ Facets for the cut cone. I ⋮ Enumeration of the facets of cut polytopes over some highly symmetric graphs ⋮ The six-dimensional Delaunay polytopes ⋮ Collapsing and lifting for the cut cone
Cites Work
This page was built for publication: All facets of the cut cone \(C_ n\) for \(n=7\) are known
