Abstract
A graph G is said to be aSeymour graph if for any edge set F there exist |F| pairwise disjoint cuts each containing exactly one element of F, provided for every circuit C of G the necessary condition |C ∩ F| ≤ |C ∖ F| is satisfied. Seymour graphs behave well with respect to some integer programs including multiflow problems, or more generally odd cut packings, and are closely related to matching theory.
A first coNP characterization of Seymour graphs has been shown by Ageev, Kostochka and Szigeti [1], the recognition problem has been solved in a particular case by Gerards [2], and the related cut packing problem has been solved in the corresponding special cases. In this article we show a new, minor-producing operation that keeps this property, and prove excluded minor characterizations of Seymour graphs: the operation is the contraction of full stars, or of odd circuits. This sharpens the previous results, providing at the same time a simpler and self-contained algorithmic proof of the existing characterizations as well, still using methods of matching theory and its generalizations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ageev, A.A., Kostochka, A.V., Szigeti, Z.: A characterization of Seymour graphs. J. Graph Theory 24, 357–364 (1997)
Gerards, A.M.H.: On shortest T-joins and packing T-cuts. J. Combin. Theory Ser. B 5, 73–82 (1992)
Lovász, L.: 2-matchings and 2-covers of hypergraphs. Acta. Math. Sci. Hungar. 26, 433–444 (1975)
Lovász, L., Plummer, M.D.: Matching Theory, Akadémiai Kiadó, Budapest (1986)
Middendorf, M., Pfeiffer, F.: On the complexity of the edge-disjoint paths problem. Combinatorica 13(1), 97–108 (1993)
Guan, M.G.: Graphic programming using odd and even points. Chinese Mathematics 1, 273–277 (1962)
Sebö, A.: o, Undirected distances and the postman structure of graphs. J. Combin. Theory Ser. B 49, 10–39 (1990)
Seymour, P.D.: The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B 23, 189–222 (1977)
Seymour, P.D.: On odd cuts and plane multicommodity flows. Proc. London Math. Soc. Ser. 42(3), 178–192 (1981)
Szigeti, Z.: On Seymour graphs, Technical Report No. 93803, Institute for Operations Research, Universität Bonn (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ageev, A., Benchetrit, Y., Sebő, A., Szigeti, Z. (2011). An Excluded Minor Characterization of Seymour Graphs. In: Günlük, O., Woeginger, G.J. (eds) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, vol 6655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20807-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-20807-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20806-5
Online ISBN: 978-3-642-20807-2
eBook Packages: Computer ScienceComputer Science (R0)