This preview shows page 1. Sign up to view the full content.
Unformatted text preview: S in the graph G to be a vertex cover if all edges of G have at least one of their vertices in S . Let ( G ) denote the size of the smallest vertex cover of G and let ( G ) denote the size of its maximum matching. We proved the following theorem: K onigs Theorem. In any bipartite graph G , ( G ) = ( G ). 2 Prove Halls Marriage Theorem from K onigs Theorem....
View Full Document
- Spring '11