Short proofs on the matching polyhedron

DOI10.1016/0095-8956(83)90011-4zbMath0513.05058OpenAlexW2130444404MaRDI QIDQ1050377

Alexander Schrijver

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/10052

zbMATH Keywords

Edmond's matching polyhedron theorem

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items

Matchings in regular graphs: minimizing the partition function, Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions, A compact linear program for testing optimality of perfect matchings., A weighted even factor algorithm, Proving total dual integrality with cross-free families—A general framework, Balanced network flows. VI. Polyhedral descriptions, Structural properties of matroid matchings, An identity for matching and skew-symmetric determinant, Maximal matching polytope in trees, The optimal path-matching problem, Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs, A note on matchings and separability

Cites Work

• Matchings in regular graphs
• Graph Theory and Integer Programming
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Maximum matching and a polyhedron with 0,1-vertices
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item