Abstract
We present a new Min-Max theorem for an optimization problem closely connected to matchings and vertex covers in balanced hypergraphs. The result generalizes Kőnig’s Theorem (Berge and Las Vergnas in Ann N Y Acad Sci 175:32–40, 1970; Fulkerson et al. in Math Progr Study 1:120–132, 1974) and Hall’s Theorem (Conforti et al. in Combinatorica 16:325–329, 1996) for balanced hypergraphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berge C (1970) Sur certains hypergraphes généralisant les graphes bipartites. Combin Theory Appl I 4:119–133
Berge C (1973) Notes sur les bonnes colorations d’un hypergraphe. colloque sur la théorie des graphes. Cahiers Centre Études Rech Opér 15:219–223
Berge C, Las Vergnas M (1970) Sur un théorème du type König pour hypergraphes. Ann N Y Acad Sci 175:32–40
Conforti M, Cornuéjols G, Kapoor A, Vušković K (1996) Perfect matchings in balanced hypergraphs. Combinatorica 16:325–329
Fulkerson DR, Hoffman AJ, Oppenheim R (1974) On balanced matrices. Math Progr Study 1:120–132
Huck A, Triesch E (2002) Perfect matchings in balanced hypergraphs—a combinatorial approach. Combinatorica 22:409–416
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Scheidweiler, R., Triesch, E. A note on the duality between matchings and vertex covers in balanced hypergraphs. J Comb Optim 32, 639–644 (2016). https://doi.org/10.1007/s10878-015-9887-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-015-9887-5