Premium
A short proof of König's matching theorem
Author(s) -
Rizzi Romeo
Publication year - 2000
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(200003)33:3<138::aid-jgt2>3.0.co;2-k
Subject(s) - mathematics , bipartite graph , combinatorics , matching (statistics) , discrete mathematics , graph , cover (algebra) , graph theory , statistics , mechanical engineering , engineering
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