ConceptTheory & Algos
Hall's theorem
A theorem in combinatorics that provides a necessary and sufficient condition for a bipartite graph to have a perfect matching.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.