Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour
DOI10.1137/S0895480100371389zbMath1035.90045OpenAlexW2085151508WikidataQ123230616 ScholiaQ123230616MaRDI QIDQ4785688
Guenin, Bertrand, Cornuéjols, Gérard
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480100371389
connectivityseparationmulticommodity flowideal clutterSeymour's conjecture\(T\)-cutweakly bipartite graphsigned matroid
Programming involving graphs or networks (90C35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Integer programming (90C10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items