König’s theorem: in a bipartite graph, the size of the maximum matching equals the size of the minimum vertex cover