A short proof of K�nig's matching theore
✍
Rizzi, Romeo
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 43 KB
👁 2 views
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.