Highly Influenced

# On cuts and matchings in planar graphs

@article{Barahona1993OnCA, title={On cuts and matchings in planar graphs}, author={Francisco Barahona}, journal={Math. Program.}, year={1993}, volume={60}, pages={53-68} }

- Published 1993 in Math. Program.
DOI:10.1007/BF01580600

The convex hull of the incidence vectors of matchings in a graph has been characterized by Edmonds (1965). In his pioneering paper, Edmonds showed that exponentially many inequalities may be necessary. Several other polytopes related to combinatorial problems have been characterized by systems whose number of inequalities is exponential in the size of the problem. One example is the Cut Polytope for graphs not contractible to Ks, see Barahona and Mahjoub (1986a). In this paper we show that the… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

48 Citations

13 References

Similar Papers