Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
matchings in graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Berge's lemma
|
| gptkbp:namedAfter |
gptkb:Claude_Berge
|
| gptkbp:publicationYear |
1957
|
| gptkbp:publishedIn |
gptkb:Acta_Mathematica
|
| gptkbp:relatedTo |
combinatorics
optimization maximum matching problem |
| gptkbp:state |
A matching is maximum if and only if there is no augmenting path with respect to it
|
| gptkbp:usedIn |
gptkb:Edmonds'_blossom_algorithm
gptkb:Hungarian_algorithm algorithm design |
| gptkbp:bfsParent |
gptkb:Tutte–Berge_formula
|
| gptkbp:bfsLayer |
6
|