Abstract
We present a min-max formula and a polynomial time algorithm for a slight generalization of the following problem: in a simple undirected graph in which the degree of each node is at most t + 1, find a maximum t-matching containing no member of a list \(\mathcal{K}\) of forbidden K t,t and K t + 1 subgraphs. An analogous problem for bipartite graphs without degree bounds was solved by Makai [15], while the special case of finding a maximum square-free 2-matching in a subcubic graph was solved in [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bérczi, K., Kobayashi, Y.: An Algorithm for (n − 3)–Connectivity Augmentation Problem: Jump System Approach. Technical report, Department of Mathematical Engineering, University of Tokyo, METR 2009-12
Cornuéjols, G., Pulleyblank, W.: A Matching Problem With Side Conditions. Discrete Math. 29, 135–139 (1980)
Frank, A.: Restricted t-matchings in Bipartite Graphs. Discrete Appl. Math. 131, 337–346 (2003)
Frank, A., Jordán, T.: Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory Ser. B 65, 73–110 (1995)
Gabow, H.N.: An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems. In: STOC ’83: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pp. 448–456. ACM, New York (1983)
Hartvigsen, D.: Extensions of Matching Theory. PhD Thesis, Carnegie-Mellon University (1984)
Hartvigsen, D.: The Square-Free 2-factor Problem in Bipartite Graphs. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 234–241. Springer, Heidelberg (1999)
Hartvigsen, D.: Finding maximum square-free 2-matchings in bipartite graphs. J. Comb. Theory Ser. B 96, 693–705 (2006)
Hartvigsen, D., Li, Y.: Triangle-Free Simple 2-matchings in Subcubic Graphs (Extended Abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 43–52. Springer, Heidelberg (2007)
Király, Z.: C 4-free 2-factors in Bipartite Graphs. Technical report, Egerváry Research Group, Department of Operations Research, Eötvös Loránd University, Budapest, TR-2001-13 (2001)
Király, Z.: Restricted t-matchings in Bipartite Graphs. Technical report, Egerváry Research Group, Department of Operations Research, Eötvös Loránd University, Budapest, TR-2009-04 (2009)
Kobayashi, Y.: A Simple Algorithm for Finding a Maximum Triangle-Free 2-matching in Subcubic Graphs. Technical report, Department of Mathematical Engineering, University of Tokyo, METR 2009-26 (2009)
Kobayashi, Y., Takazawa, K.: Even Factors, Jump Systems, and Discrete Convexity. Technical report, Department of Mathematical Engineering, University of Tokyo, METR 2007-36 (2007)
Kobayashi, Y., Takazawa, K.: Square-Free 2-matchings in Bipartite Graphs and Jump Systems. Technical report, Department of Mathematical Engineering, University of Tokyo, METR 2008-40 (2008)
Makai, M.: On Maximum Cost K t,t -free t-matchings of Bipartite Graphs. SIAM J. Discret. Math. 21, 349–360 (2007)
Pap, G.: Alternating Paths Revisited II: Restricted b-matchings in Bipartite Graphs. Technical report, Egerváry Research Group, Department of Operations Research, Eötvös Loránd University, Budapest, TR-2005-13 (2005)
Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)
Szabó, J.: Jump systems and matroid parity (in hungarian). Master’s Thesis, Eötvös Loránd University, Budapest (2002)
Takazawa, K.: A Weighted K t,t -free t-factor Algorithm for Bipartite Graphs. Math. Oper. Res. 34, 351–362 (2009) (INFORMS)
Végh, L. A.: Augmenting Undirected Node-Connectivity by One. Technical report, Egerváry Research Group, Department of Operations Research, Eötvös Loránd University, Budapest, TR-2009-10 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bérczi, K., Végh, L.A. (2010). Restricted b-Matchings in Degree-Bounded Graphs. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-13036-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13035-9
Online ISBN: 978-3-642-13036-6
eBook Packages: Computer ScienceComputer Science (R0)