The matroids with the max-flow min-cut property

DOI10.1016/0095-8956(77)90031-4zbMath0375.05022WikidataQ56503917 ScholiaQ56503917MaRDI QIDQ1245970

P. D. Seymour

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90031-4

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

Perfect, ideal and balanced matrices, Ideal clutters, Tight integral duality gap in the Chinese postman problem, A characterization of knapsacks with the max-flow--min-cut property, On shortest \(T\)-joins and packing \(T\)-cuts, A catalog of minimally nonideal matrices, A rounding algorithm for integer programs, A note on clutter partitions, A short proof of Seymour's characterization of the matroids with the max-flow min-cut property, Packing odd circuits in Eulerian graphs, Packing cycles in graphs, On a min--max theorem on bipartite graphs, Clutters with \(\tau_ 2 \Relbar 2\tau\), A note on maxflow-mincut and homomorphic equivalence in matroids, Vertex set partitions preserving conservativeness, A characterization of weakly bipartite graphs, A short proof of Guenin's characterization of weakly bipartite graphs, Compositions for matroids with the Fulkerson property, Generalizing the all-pairs min cut problem, Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\), One-third-integrality in the max-cut problem, Independence and port oracles for matroids, with an application to computational learning theory, A sharp bound on the size of a connected matroid