Perfect matchings versus odd cuts
From MaRDI portal
\textit{J. Edmonds, L. Lovász} and \textit{W. R. Pulleyblank} [Combinatorica 2, 247-274 (1982; Zbl 0521.05035)] determined the dimension of the perfect matching polytope of an arbitrary graph. A crucial step in their proof is the tight cut lemma. The main consequence of this paper is a purely graph-theoretic proof of the result.
Recommendations
Cited in
(16)- On tight cuts in matching covered graphs
- Structure of towers and a new proof of the tight cut lemma
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice
- Laminar tight cuts in matching covered graphs
- How to build a brick
- \(\mathrm{SIG}\)-dimension conjecture proved for graphs having a perfect matching
- Odd Minimum Cut Sets and b-Matchings Revisited
- Cutsets in bipartite graphs*
- Disjoint odd cycles in cubic solid bricks
- Touching perfect matchings and halving lines
- scientific article; zbMATH DE number 4114689 (Why is no real title available?)
- A note on tight cuts in matching-covered graphs
- Basilica: new canonical decomposition in matching theory
- On cuts and matchings in planar graphs
- Claw-free solid bricks
- The perfect matching polytope and solid bricks
This page was built for publication: Perfect matchings versus odd cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410409)
