Matchings and flows

Matchings and factors in graphs, stable matchings, and flows in networks, including Kőnig's theorem, Berge's lemma and the max-flow min-cut theorem.

• Berge's lemma
• Kőnig's theorem
• Matching cuts
• Max-flow min-cut theorem
• Petersen's theorem
• Stable marriage problem

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.