The matroids with the max-flow min-cut property

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

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

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

On Packing Dijoins in Digraphs and Weighted Digraphs, A rounding algorithm for integer programs, The positive circuits of oriented matroids with the packing property or idealness, Families of cuts with the MFMC-property, A note on clutter partitions, Idealness of k-wise Intersecting Families, A decomposition theory for matroids. III. Decomposition conditions, A survey on flows in graphs and matroids, Binary group and Chinese postman polyhedra, An O(m n) algorithm for regular set-covering problems, Undirected distances and the postman-structure of graphs, Matrices with the Edmonds-Johnson property, Directed cut transversal packing for source-sink connected graphs, The Schrijver system of odd join polyhedra, Compositions for matroids with the Fulkerson property, Antisymmetric flows in matroids, Recognizing max-flow min-cut path matrices, Convex hull characterizations of lexicographic orderings, Clean Clutters and Dyadic Fractional Packings, Generalizing the all-pairs min cut problem, Intersecting and dense restrictions of clutters in polynomial time, Intersecting restrictions in clutters, Polyhedra of regular p-nary group problems, A Framework for the Secretary Problem on the Intersection of Matroids, A decomposition strategy for the vertex cover problem, A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids, 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, Clean tangled clutters, simplices, and projective geometries, On combinatorial properties of binary spaces, A characterization of Seymour graphs, A new infinite family of minimally nonideal matrices, Trader multiflow and box-TDI systems in series-parallel graphs, Algebraic flows in regular matroids, Deltas, extended odd holes and their blockers, A characterization of minimal non-Seymour graphs, 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, Dual row modules and polyhedra of blocking group problems, Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation, Matroids and multicommodity flows, Decomposition of group flows in regular matroids, Optimal cocircuits in regular matroids and applications, On a min--max theorem on bipartite graphs, The Klein bottle and multicommodity flows, The ellipsoid method and its consequences in combinatorial optimization, The max-flow min-cut property and \(\pm 1\)-resistant sets, The complexity of recognizing linear systems with certain integrality properties, A sharp bound on the size of a connected matroid, An Excluded Minor Characterization of Seymour Graphs, Cuboids, a class of clutters, Ranking tournaments with no errors. II: Minimax relation, On ideal clutters, metrics and multiflows, Tight integral duality gap in the Chinese postman problem, A characterization of knapsacks with the max-flow--min-cut property, Lattice flows in networks, The max-flow min-cut property of two-dimensional affine convex geometries, Some insight into characterizations of minimally nonideal matrices, On the complexity of recognizing directed path families, Ideal clutters, On shortest \(T\)-joins and packing \(T\)-cuts, Complexity results on restricted instances of a paint shop problem for words, Perfect, ideal and balanced matrices, Solution of two fractional packing problems of Lovász. (Reprint), Max-multiflow/min-multicut for G+H series-parallel, On the planar integer two-flow problem, Chords and disjoint paths in matroids, A new infinite class of ideal minimally non-packing clutters, Ranking tournaments with no errors. I: Structural description, A note on the production of matroid minors, A two-commodity cut theorem, Box-total dual integrality, box-integrality, and equimodular matrices, Clutters with \(\tau_ 2 \Relbar 2\tau\), Solution of two fractional packing problems of Lovász, On the set covering polyhedron of circulant matrices, Opposite Elements in Clutters, Ideal Clutters That Do Not Pack, Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids, Lehman matrices, On Four Problems in Graph Theory, On fractional cut covers, Paintshop, odd cycles and necklace splitting, A decomposition of the matroids with the max-flow min-cut property, Four problems on graphs with excluded minors, Resistant Sets in the Unit Hypercube, Combinatorial analysis. (Matrix problems, choice theory), A note on maxflow-mincut and homomorphic equivalence in matroids, A catalog of minimally nonideal matrices, Packing and covering of crossing families of cuts, Vertex set partitions preserving conservativeness, A characterization of weakly bipartite graphs, A short proof of Guenin's characterization of weakly bipartite graphs, A family of perfect graphs associated with directed graphs, Total weak unimodularity: Testing and applications, On some weakly bipartite graphs, Testing idealness in the filter oracle model, Tight Cycle Relaxations for the Cut Polytope, Idealness of \(k\)-wise intersecting families

Cites Work