Facets of I-matching polyhedra

  • W. Pulleyblank
  • Jack Edmonds
Part II: Graphs, Matroids, Designs
Part of the Lecture Notes in Mathematics book series (LNM, volume 411)


Perfect Match Unique Member Maximum Weighted Match Elementary Linear Algebra Maximal Connected Subgraph 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Edmonds, "Paths, Trees and Flowers", Canadian J. Math. 17, 449–467 (1965).MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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. 3.
    J. Stoer, C. Witzgall, Convexity and Optimization in Finite Dimensions I, Springer-Verlag, Berlin, Heidelberg (1970).CrossRefzbMATHGoogle Scholar
  4. 4.
    W.T. Tutte, "The Factorization of Linear Graphs", J. London Math. Soc. 22, 107–111 (1947).MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    C. Berge, "Sur le couplage maximum d’un graphe" C.R. Acad. Sci. Paris 247, 258–259 (1958).MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • W. Pulleyblank
    • 1
  • Jack Edmonds
    • 1
  1. 1.University of WaterlooUSA

Personalised recommendations