Skip to main content

Facets of I-matching polyhedra

  • Part II: Graphs, Matroids, Designs
  • Conference paper
  • First Online:
Hypergraph Seminar

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 411))

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Edmonds, "Paths, Trees and Flowers", Canadian J. Math. 17, 449–467 (1965).

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Edmonds, "Maximum Matching and a Polyhedron with 0, 1-Vertices", J. Res. Nat. Bur. of Standards 69B, (Math and Math Phys.) No. 1, 125–130 (1965).

    Google Scholar 

  3. J. Stoer, C. Witzgall, Convexity and Optimization in Finite Dimensions I, Springer-Verlag, Berlin, Heidelberg (1970).

    Book  MATH  Google Scholar 

  4. W.T. Tutte, "The Factorization of Linear Graphs", J. London Math. Soc. 22, 107–111 (1947).

    Article  MathSciNet  MATH  Google Scholar 

  5. C. Berge, "Sur le couplage maximum d’un graphe" C.R. Acad. Sci. Paris 247, 258–259 (1958).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Claude BergeDijen Ray-Chaudhuri

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Pulleyblank, W., Edmonds, J. (1974). Facets of I-matching polyhedra. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066196

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06846-4

  • Online ISBN: 978-3-540-37803-7

  • eBook Packages: Springer Book Archive

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics