Mathematics
Bipartite Graphs and Matching Theory
Quick fact
A graph is bipartite exactly when it has no odd-length cycles. This simple property makes many hard-seeming problems, like finding the largest set of non-conflicting pairs, solvable efficiently.
Why this is interesting
You have 3 workers and 4 tasks, each worker can only do certain tasks. How many tasks can you get done? What if you had to assign every worker? This is the classic job-assignment puzzle, and its solution lies in a simple but deep mathematical structure.