Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
From MaRDI portal
(Redirected from Publication:1013288)
Abstract: A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties, most of them related to their defect which is the number of vertices minus two times the stability number. In particular, a remarkable result of Lov'asz (1978) is the finite basis theorem for alpha-critical graphs of a fixed defect. The class of alpha-critical graphs is also of interest for at least two topics of polyhedral studies. First, Chv'atal (1975) shows that each alpha-critical graph induces a rank inequality which is facet-defining for its stable set polytope. Investigating a weighted generalization, Lipt'ak and Lov'asz (2000, 2001) introduce critical facet-graphs (which again produce facet-defining inequalities for their stable set polytopes) and they establish a finite basis theorem. Second, Koppen (1995) describes a construction that delivers from any alpha-critical graph a facet-defining inequality for the linear ordering polytope. Doignon, Fiorini and Joret (2006) handle the weighted case and thus define facet-defining graphs. Here we investigate relationships between the two weighted generalizations of alpha-critical graphs. We show that facet-defining graphs (for the linear ordering polytope) are obtainable from 1-critical facet-graphs (linked with stable set polytopes). We then use this connection to derive various results on facet-defining graphs, the most prominent one being derived from Lipt'ak and Lov'asz's finite basis theorem for critical facet-graphs. At the end of the paper we offer an alternative proof of Lov'asz's finite basis theorem for alpha-critical graphs.
Recommendations
- Critical facets of the stable set polytope
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- Stability critical graphs and ranks facets of the stable set polytope
- Facets with fixed defect of the stable set polytope
- Critical edges in perfect line graphs and some polyhedral consequences
Cites work
- Critical facets of the stable set polytope
- Facets of the linear ordering polytope
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- Facets with fixed defect of the stable set polytope
- Further facet generating procedures for vertex packing polytopes
- Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- How to recycle your facets
- scientific article; zbMATH DE number 3596866 (Why is no real title available?)
- Matching theory
- More facets from fences for linear ordering and acyclic subgraph polytopes
- On certain polytopes associated with graphs
- Random utility representation of binary choice probabilities: A new class of necessary conditions
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- The biorder polytope
- The complexity of facets (and some facets of complexity)
Cited in
(4)
This page was built for publication: Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013288)
