This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
State and prove König's theorem: in bipartite graphs, the size of a maximum matching equals the minimum vertex cover.
You've completed the free preview. Subscribe to unlock every lesson in every course.