Cantor-Schröder-Bernstein's theorem tells that given sets A and B, if there're injective functions f : A → B and g : B → A, then there's a bijection h : A → B.
A famous proof, given by J. König is strikingly similar to the Khun's algorithm for max bipartite matching.
12 months ago