Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Berge's theorem
|
| gptkbp:namedAfter |
gptkb:Claude_Berge
|
| gptkbp:relatedConcept |
matching
augmenting path |
| gptkbp:sentence |
A matching in a graph is maximum if and only if there is no augmenting path with respect to it.
|
| gptkbp:usedIn |
proof of Edmonds' blossom algorithm
proof of the Hungarian algorithm |
| gptkbp:yearProposed |
1957
|
| gptkbp:bfsParent |
gptkb:Claude_Berge
|
| gptkbp:bfsLayer |
7
|