Perfect matchings versus odd cuts (Q1410409): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 04:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings versus odd cuts |
scientific article |
Statements
Perfect matchings versus odd cuts (English)
0 references
14 October 2003
0 references
\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.
0 references
matching
0 references
cut
0 references
critical graphs
0 references
