A short proof of König's matching theorem
Roméo Rizzi · Journal of Graph Theory · 2000
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