Abstract
We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with edges, including , , , , some other , , , Möbius ladder , Dodecahedron, Heawood and Petersen graphs. For , it shows that the huge lists of facets of the cut polytope and cut cone , given in [CR] is complete. We also confirm the conjecture that any facet of is adjacent to a triangle facet. The lists of facets for with solve problems (see, for example, [Werner]) in quantum information theory.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.