Edmonds-Gallai Decomposition

Finding all matchings efficiently

Tutte-Berge Formula

The shrunk Graph

proof follows out of claim 3 and 4

$\delta (H)$ := outgoing Edges (one Endpoint in $H$ and one not in $H$)
factor critical matching