graph-theory
Hall's marriage theorem
taught
Taught in
-
Hall's marriage theorem
Discrete Mathematics II — Combinatorics
-
Hall's theorem, revisited
Graph Theory
Requires
- maximum-matchings required
Required by
- Applications of Hall's theorem required
- Bipartite matching as a flow problem required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.