This preview shows page 1. Sign up to view the full content.
Unformatted text preview: G . A set of vertices S in the graph G is called 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. 3 Prove that in any graph G , the inequality ν ( G ) ≤ τ ( G ) holds. 4 Prove that in any bipartite graph G , we actually have ν ( G ) = τ ( G )....
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