Konig's Theorem

Last updated Nov 1, 2022

Suppose $G = (V, E)$ is a Bipartite Graph. Then the Vertex Cover and Matching Duality is strict. That is, $\tau(G) = \nu(G)$.

TODO - See Cook - Combinatorial Optimization, early on, but I forget what page

• Cook - Combinatorial Optimization
• Original source? TODO

• Maximum Matching
• Vertex Cover