Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Barahona. On the complexity of max cut. Rapport de Recherche No. 186, Mathematiques Appliqués et Informatiques, Université Scientifique et Medicale de Grenoble, France, 1980.
F. Barahona. The max cut problem in graphs not contractible to K 5. Oper. Res. Lett., 2:107–111, 1983.
W. G. Bridges and H. J. Ryser. Combinatorial designs and related systems. J. Algebra, 13:432–446, 1969.
G. Cornuéjols and B. Novick. Ideal 0, 1 matrices. J. Comb. Theory Ser. B, 60:145–157, 1994.
J. Fonlupt, A. R. Mahjoub, and J. P. Uhry. Composition of graphs and the bipartite subgraph polytope. Research Report No. 459, Laboratoire ARTEMIS (IMAG), Université de Grenoble, Grenoble, 1984.
A. M. H. Gerards. Graphs and Polyhedra: Binary Spaces and Cutting Planes. PhD thesis, Tilburg University, 1988.
A. M. H. Gerards. Multi-commodity flows and polyhedra. CWI Quarterly, 6(3), 1993.
M. Grötschel and W. R. Pulleyblank. Weakly bipartite graphs and the max-cut problem. Operations Research Letters, 1:23–27, 1981.
B. Guenin. A characterization of weakly bipartite graphs. Working paper, GSIA, Carnegie Mellon Univ., Pittsburgh, PA 15213, 1997.
R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, 1972.
A. Lehman. A solution of the Shannon switching game. J. SIAM, 12(4):687–725, 1964.
A. Lehman. On the width-length inequality, mimeographic notes. Mathematical Programming, 17:403–417, 1979.
A. Lehman. On the width-length inequality and degenerate projective planes. In W. Cook and P.D. Seymour, editors, Polyhedral Combinatorics, DIMACS Series in Discrete Math. and Theoretical Computer Science, Vol. 1, pages 101–105, 1990.
C. Luetolf and F. Margot. A catalog of minimally nonideal matrices. Mathematical Methods of Operations Research, 1998. To appear.
B. Novick and A. Sebö. On Combinatorial Properties of Binary Spaces. IPCO Proceedings, 1995.
M. W. Padberg. Lehman’s forbidden minor characterization of ideal 0–1 matrices. Discrete Math. 111:409–420, 1993.
P. D. Seymour. The forbidden minors of binary clutters. J. of Combinatorial Theory B, 22:356–360, 1976.
P. D. Seymour. The matroids with the max-flow min-cut property. J. Comb. Theory Ser. B, 23:189–222, 1977.
P. D. Seymour. Matroids and multicommodity flows. European J. of Combinatorics, 257–290, 1981.
P. D. Seymour. On Lehman’s width-length characterization. In W. Cook, and P. D. Seymour, editors, Polyhedral Combinatorics, DIMACS Series in Discrete Math. and Theoretical Computer Science, Vol. 1, pages 107–117, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guenin, B. (1998). A Characterization of Weakly Bipartite Graphs. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds) Integer Programming and Combinatorial Optimization. IPCO 1998. Lecture Notes in Computer Science, vol 1412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69346-7_2
Download citation
DOI: https://doi.org/10.1007/3-540-69346-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64590-0
Online ISBN: 978-3-540-69346-8
eBook Packages: Springer Book Archive