Berge's theorem

Berge's theorem is a foundational result in combinatorial optimization and graph theory, specifically relating to bipartite graphs. The theorem provides a characterization of maximum matchings in bipartite graphs and links it to the concept of "augmenting paths.