A note on the duality between matchings and vertex covers in balanced hypergraphs
- 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.
| Author: | Robert Scheidweiler, Eberhard Triesch |
|---|---|
| DOI: | https://doi.org/10.1007/s10878-015-9887-5 |
| ISSN: | 1573-2886 |
| Parent Title (English): | Journal of Combinatorial Optimization |
| Publisher: | Springer |
| Place of publication: | Berlin |
| Document Type: | Article |
| Language: | English |
| Year of Completion: | 2016 |
| Tag: | Balanced hypergraph; Duality; Hall’s Theorem; Hypergraph; Koenig’s Theorem; Matching; Vertex cover |
| Volume: | 32 |
| Issue: | 2 |
| First Page: | 639 |
| Last Page: | 644 |
| Note: | Lehrstuhl II für Mathematik RWTH Aachen |
| Link: | https://doi.org/10.1007/s10878-015-9887-5 |
| Zugriffsart: | weltweit |
| Institutes: | FH Aachen / Fachbereich Maschinenbau und Mechatronik |
| collections: | Verlag / Springer |
