P
Initializing...
Kőnig's theorem, vertex-cover form: if every matching of a finite bipartite edge set $E\subseteq A\times B$ has at most $k$ edges, then $E$ has a vertex cover of size at most $k$ · Prove2Me