The matroids with the max-flow min-cut property (Q1245970): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56503917, #quickstatements; #temporary_batch_1707303357582
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Ralph G.Stanton / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Ralph G.Stanton / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(77)90031-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981295749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(l\)-matrices and a characterization of binary matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing rooted directed cuts in a weighted directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über reguläre Kettengruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solution of the Shannon Switching Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the width—length inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5516084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the production of matroid minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid representation over GF(3) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Forbidden Minors of Binary Clutters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3249424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity in Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-commodity cut-packing problem / rank
 
Normal rank

Latest revision as of 22:10, 12 June 2024

scientific article
Language Label Description Also known as
English
The matroids with the max-flow min-cut property
scientific article

    Statements

    The matroids with the max-flow min-cut property (English)
    0 references
    0 references
    1977
    0 references
    The max-flow min-cut theorem is possessed by a matroid if and only if the matroid is binary and has no minor which isomorphic to the dual of the Fano matroid.
    0 references

    Identifiers