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¨ onig’s Theorem. In any bipartite graph G , ν ( G ) = τ ( G ). 2 Prove Hall’s Marriage Theorem from K¨ onig’s Theorem....
View
Full
Document
This note was uploaded on 12/10/2011 for the course MAD 4204 taught by Professor Vetter during the Spring '11 term at University of Florida.
 Spring '11
 Vetter

Click to edit the document details