Skip to main content
Springer Nature Link
Log in

Optimum matching forests III: Facets of matching forest polyhedra

  • Published:
Mathematical Programming Submit manuscript

Abstract

In [3] we presented a linear system which definesP(G), the convex hull of incidence vectors of matching forests of a mixed graphG. However, many of the inequalities of this system may be redundant. Here we describe the dimension of the facets ofP(G) obtained by setting one inequality of the defining system forP(G) to an equation. This leads to a presentation of a minimal defining linear system forP(G), i.e., to a presentation of the facets ofP(G). This generalizes earlier characterizations of facets of 1-matching polyhedra and of branching polyhedra.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Giles, “Facets and other faces of branching polyhedra”, Proceedings of the Fifth Hungarian Combinatorial Colloquium (1976), 401–418.

  2. R. Giles, “Optimum matching forests I: Special weights”,Mathematical Programming 22 (1982) 1–11.

    Google Scholar 

  3. R. Giles, “Optimum matching forests II: General weights”,Mathematical Programming 22 (1982) 12–38.

    Google Scholar 

  4. M. Grötschel, “Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme”, Dissertation, Bonn, W. Germany,Mathematical Systems in Economics 36 (Verlag Anton Hain, Meisenheim am Glan, W. Germany, 1977).

    Google Scholar 

  5. L. Lovász, “A note on factor critical graphs”,Studia Scientiarum Mathematicarum Hungarica 7 (1972) 279–280.

    Google Scholar 

  6. W. R. Pulleyblank and J. Edmonds, “Facets of 1-matching polyhedra”,Hypergraph seminar, Ohio State University 1972, Springer-Verlag Lecture Notes in Mathematics No. 411 (Springer, Berlin, 1974), pp. 214–242.

    Google Scholar 

  7. J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, Berlin, 1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Kentucky, 40506, Lexington, KY, USA

    Rick Giles

Authors
  1. Rick Giles
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Research partially supported by a N.R.C. Canada Postdoctorate Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giles, R. Optimum matching forests III: Facets of matching forest polyhedra. Mathematical Programming 22, 39–51 (1982). https://doi.org/10.1007/BF01581024

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581024

Key words