Ideal binary clutters, connectivity, and A conjecture of seymour

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 3, 2002, Pages 329-352

  Cornuéjols, Gérard ^a   Guenin, Bertrand ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Connectivity; Ideal clutter; Multicommodity flow; Separation; Seymour's conjecture; Signed matroid; T cut; Weakly bipartite graph

Indexed keywords

CONNECTIVITY; IDEAL CLUTTER; MULTICOMMODITY FLOW; SEYMOUR'S CONJECTURE; SIGNED MATROID; T-CUT; WEAKLY BIPARTITE GRAPH;

COMPUTATIONAL METHODS; GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

BINARY CODES;

EID: 0012693565     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100371389     Document Type: Article

References (29)

1. R. E. BIXBY, On the length-width inequality for compound clutters, J. Combin. Theory Ser. B, 11 (1971) pp. 246-248.
2. W. G. BRIDGES AND H. J. RYSER, Combinatorial designs and related systems, J. Algebra, 13 (1969), pp. 432-446.
3. T. H. BRYLAWSKI, A decomposition for combinatorial geometries, Trans. Amer. Math. Soc., 171 (1972), pp. 235-282.
4. S. CHOPRA, Composition for matroids with the Fulkerson property, Discrete Appl. Math., 62 (1995), pp. 87-101.
5. J. EDMONDS AND R. GILES, A min-max relation for submodular functions on graphs, Ann. Discrete Math., 1 (1977), pp. 185-204.
6. J. EDMONDS AND E. L. JOHNSON, Matching, Euler tours and the Chinese postman, Math. Programming, 5 (1973), pp. 88-124.
7. D. R. FULKERSON, Blocking and anti-blocking pairs of polyhedra, Math. Programming, 1 (1971), pp 168-194.
8. A. M. H. GERARDS, Graphs and Polyhedra, Binary Spaces and Cutting Planes, CWI Tract 73, Mathematische Centrum, Amsterdam, 1990.
9. A. M. H. GERARDS, Multi-commodity flows and polyhedra, CWI Quarterly, 6 (1993), pp. 281-296.
10. B. GUENIN, A characterization of weakly bipartite graphs, J Combin. Theory Ser. B, 83 (2001), pp. 112-168.
11. S. R. KINGAN, A generalization of a graph result of D.W. Hall, Discrete Math., 173 (1997), pp. 129-135.
12. M.-K. KWAN, Graphic programming using odd or even points, Acta Math. Sinica, 10 (1960), pp. 263-266 (in Chinese).
13. A. LEHMAN, A solution of the Shannon switching game, J. Soc. Indust. Appl. Math., 12 (1964), pp. 687-725.
14. A. LEHMAN, On the width-length inequality, Math Programming, 17 (1979), pp. 403-417.
15. A. LEHMAN, The width-length inequality and degenerate projective, planes, in Polyhedral Combinatorics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1, W. Cook and P.D. Seymour, eds., AMS, Providence, RI, 1990, pp. 101-105.
16. C. LUETOLF AND F. MARGOT, A catalog of minimally nonideal matrices, Math. Methods Oper. Res., 47 (1998). pp. 221-241.
17. P. NOBILI AND A. SASSANO, The anti-join composition and polyhedra, Discrete Math., 119 (1993), pp. 141-166
18. P. NOBILI AND A. SASSANO, Polyhedral properties of clutter amalgam, SIAM J. Discrete Math., 6 (1993), pp. 139-151
19. P. NOBILI AND A. SASSANO, Composition operations for clutters and related polyhedra, Methods Oper. Res., 62 (1990), pp. 235-247.
20. B. NOVICK AND A. SEBÖ, On combinatorial properties of binary spaces, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 920, Springer-Verlag, Berlin. 1995, pp. 212-227.
21. J. G OXLEY, Matroid Theory, Oxford University Press, New York, 1992.
22. M. W. PADBERG, Lehman's forbidden minor characterization of ideal 0-1 matrices, Discrete Math., 111 (1993), pp. 409-420.
23. P. D. SEYMOUR, The matroids with the max-flow min-cut property, J. Combin. Theory Ser. B, 23 (1977), pp. 189-222.
24. P. D. SEYMOUR, Decomposition of regular matroids, J. Combin. Theory Ser. B, 28 (1980), pp. 305-359.
25. P. D. SEYMOUR, A note on the production of matroid minors, J. Combin. Theory Ser. B, 22 (1977), pp. 289-295.
26. P. D. SEYMOUR, Matroids and multicommodity flows, European J. Combin., 2 (1981), pp. 257-290.
27. P. D. SEYMOUR, On Lehman's width-length characterization, in Polyhedral Combinatorics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1, W. Cook and P.D. Seymour, eds., AMS, Providence, RI, 1990, pp. 107-117.
28. T. ZASLAVSKY, Signed graphs, Discrete Appl. Math., 4 (1982), pp. 47-74.
29. T ZASLAVSKY, Biased graphs. II. The three matroids, J. Combin. Theory Ser. B, 51 (1991), pp. 46-72.