Vertex Cover and Matching Duality
# Statement
Suppose $G = (V, E)$ is an Undirected Graph. Then $\tau(G) \geq \nu(G)$.
# Proof
TODO - This is a simple counting argument
# Sources
- Cook - Combinatorial Optimization - I forget what page, but early on.
Search
Suppose $G = (V, E)$ is an Undirected Graph. Then $\tau(G) \geq \nu(G)$.
TODO - This is a simple counting argument