A short proof of Seymour's characterization of the matroids with the max-flow min-cut property (Q1403921): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jctb.2002.2127 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064861714 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing odd circuits in Eulerian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The matroids with the max-flow min-cut property / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTB.2002.2127 / rank | |||
Normal rank | |||
Latest revision as of 19:28, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of Seymour's characterization of the matroids with the max-flow min-cut property |
scientific article |
Statements
A short proof of Seymour's characterization of the matroids with the max-flow min-cut property (English)
0 references
20 August 2003
0 references
binary matroid
0 references
signed matroid
0 references
minor
0 references
