Berge's lemma

Summary

Berge's lemma is a theorem^[1]. It draws 10 Wikipedia views per month (theorem category, ranking #267 of 1,306).^[2]

Key Facts

• Berge's lemma's instance of is recorded as theorem^[3].
• Claude Berge is named after Berge's lemma^[4].
• Berge's lemma's part of is recorded as list of theorems^[5].
• Berge's lemma's Freebase ID is recorded as /m/05zzydv^[6].
• Berge's lemma's proved by is recorded as Claude Berge^[7].
• Berge's lemma's statement describes is recorded as maximum cardinality matching^[8].
• Berge's lemma's statement describes is recorded as augmenting path^[9].
• Berge's lemma's studied by is recorded as graph theory^[10].
• Berge's lemma's maintained by WikiProject is recorded as WikiProject Mathematics^[11].

Why It Matters

Berge's lemma draws 10 Wikipedia views per month (theorem category, ranking #267 of 1,306).^[2] It has Wikipedia articles in 7 language editions, a strong signal of global cultural recognition.^[12] It is known by 4 alternative names across languages and contexts.^[13]