 Bipartite vertex cover

König's theorem equates the minimum vertex-cover size of a bipartite graph with its maximum matching size.