maximum matching on bipartite graphs

• assumed
  • graphs with bounded maximum matching on bipartite graphs are included in graph class bipartite – by definition
  • maximum matching on bipartite graphs upper bounds maximum matching by a linear function – by definition
• unknown source
  • maximum matching on bipartite graphs upper and lower bounds vertex cover by a linear function – Kőnig’s theorem