Year-end Sale % OFF 
Abstract
The cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts of G; the cut cone C(G) of G is the cone generated by the incidence vectors of all cuts of G. We introduce the operation of collapsing an inequality valid over the cut cone C(Kn)of the complete graph with n vertices: it consists of identifying vertices and adding the weights of the corresponding incident edges. Using collapsing and its inverse operation (lifting), we give several methods to find facets of C(Kn). We also show how to construct facets of C(Kn) from the difference of inequalities valid over C(Kn). When G is an induced subgraph of a graph H, we give sufficient conditions to derive inequalities defining facets of Pc(H) from inequalities defining facets of Pc(G). Finally, the description (up to permutation) of the cut cone C(K7) is given.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
