ConceptMathematics
König's theorem
A theorem stating that in any bipartite graph, the size of a maximum matching is equal to the size of a minimum vertex cover.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Peter Shor
Connections
6The lectures that define it or assume it, and the concepts next to it.