A Combinatorial Proof of a König-type Theorem for Unimodular Hypergraphs
Isabel Beckenbach, Britta Peis, Oliver Schaudt, Robert Scheidweiler · 2017
We state purely combinatorial proofs for Konig- and Hall-type theorems for a wide class of combinatorial optimization problems. Our methods rely on relaxations of the matching and vertex cover problem and, moreover, on the strong coloring properties admitted by bipartite graphs and their generalizations.