thm (Konig-Egervary): in any bipartite graph, size of maximum matching = size of minimum vertex cover.