maximum matching on bipartite graphs

• unknown
  • maximum matching on bipartite graphs $k$ upper bounds bipartite by $\mathcal O(k)$ – by definition
  • maximum matching on bipartite graphs $k$ upper bounds maximum matching by $\mathcal O(k)$ – by definition
  • maximum matching on bipartite graphs $k$ implies that vertex cover is $\mathcal O(k)$ – Kőnig’s theorem