Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:describes |
maximum matching in a graph
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Tutte–Berge formula
|
| gptkbp:namedAfter |
gptkb:Claude_Berge
gptkb:W._T._Tutte |
| gptkbp:publicationYear |
1958
|
| gptkbp:publishedIn |
gptkb:Acta_Mathematica
|
| gptkbp:relatedTo |
gptkb:Berge's_lemma
gptkb:Tutte_theorem |
| gptkbp:sentence |
The size of a maximum matching in a graph G = min_{U⊆V} ½(|V| - odd(G-U) + |U|), where odd(G-U) is the number of odd components in G-U.
|
| gptkbp:bfsParent |
gptkb:Bill_Tutte
|
| gptkbp:bfsLayer |
5
|