A short proof of König's matching theorem

  • Authors:

  • Romeo Rizzi

  • Affiliations:

  • CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover. © John Wiley & Sons, Inc. J Graph Theory 33: 138–139, 2000