Gallai–Edmonds decomposition

The Gallai–Edmonds decomposition is a fundamental concept in graph theory, particularly in the study of matchings within bipartite graphs. It provides a structured way to analyze matchings and their properties, and it is named after mathematicians Claude Berge, who contributed to matching theory, and Laszlo Lovasz and others who contributed to its broader understanding.