TY  - JOUR
A1  - Scheidweiler, Robert
A1  - Triesch, Eberhard
T1  - A note on the duality between matchings and vertex covers in balanced hypergraphs
T2  - Journal of Combinatorial Optimization
N2  - 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.
KW  - Hall’s Theorem
KW  - Koenig’s Theorem
KW  - Duality
KW  - Balanced hypergraph
KW  - Hypergraph
KW  - Vertex cover
KW  - Matching
Y1  - 2016
UR  - https://opus.bibliothek.fh-aachen.de/opus4/frontdoor/index/index/docId/7875
SN  - 1573-2886
N1  - Lehrstuhl II für Mathematik RWTH Aachen
VL  - 32
IS  - 2
SP  - 639
EP  - 644
PB  - Springer
CY  - Berlin
ER  -