Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite bipartite graphs
|
| gptkbp:concerns |
bipartite graphs
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kőnig–Egerváry theorem
|
| gptkbp:namedAfter |
gptkb:Dénes_Kőnig
gptkb:Jenő_Egerváry |
| gptkbp:publishedIn |
1920s
|
| gptkbp:relatedTo |
maximum matching
minimum vertex cover |
| gptkbp:sentence |
In any bipartite graph, the size of the maximum matching equals the size of the minimum vertex cover.
|
| gptkbp:bfsParent |
gptkb:König's_theorem
|
| gptkbp:bfsLayer |
6
|