论文信息 - A Characterization of Weakly Bipartite Graphs

A Characterization of Weakly Bipartite Graphs

A labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour conjectured that a labeled graph is weakly bipartite if and only if it does not contain a minor called an odd K 5. An outline of the proof of this conjecture is given in this paper.

Bertrand Guenin

[1] A.M.H. Gerards. Graphs and polyhedra binary spaces and cutting planes , 1988 .

[2] Paul D. Seymour,et al. On Lehman's Width-Length Characterization , 1990, Polyhedral Combinatorics.

[3] Martin Grötschel,et al. Weakly bipartite graphs and the Max-cut problem , 1981, Oper. Res. Lett..

[4] Manfred W. Padberg,et al. Lehman's forbidden minor characterization of ideal 0-1 matrices , 1993, Discret. Math..

[5] Paul D. Seymour,et al. Matroids and Multicommodity Flows , 1981, Eur. J. Comb..

[6] H. Ryser,et al. COMBINATORIAL DESIGNS AND RELATED SYSTEMS , 1969 .

[7] András Sebö,et al. On Combinatorial Properties of Binary Spaces , 1995, IPCO.

[8] F. Barahona. The max-cut problem on graphs not contractible to K5 , 1983 .

[9] Gérard Cornuéjols,et al. Ideal 0, 1 Matrices , 1994, J. Comb. Theory, Ser. B.

[10] Paul Seymour,et al. The Forbidden Minors of Binary Clutters , 1976 .

[11] François Margot,et al. A catalog of minimally nonideal matrices , 1998, Math. Methods Oper. Res..

[12] Paul D. Seymour,et al. The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[13] Alfred Lehman,et al. A Solution of the Shannon Switching Game , 1964 .