Mathematics
Perfect Matchings in Bipartite Graphs and Hall's Marriage Theorem
Quick fact
Hall's theorem was first proved by Philip Hall in 1935 to solve a problem about choosing distinct representatives for a collection of sets, and it later became a cornerstone of matching theory in bipartite graphs.
Why this is interesting
Imagine you have to pair each boy with a girl they know for a school dance. When is it possible to pair everyone up? This question, simple yet deep, leads to one of the most elegant theorems in graph theory.