Statements (17)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:mathematical_concept
|
gptkbp:appliesTo |
bipartite graphs
|
gptkbp:countryOfPublication |
gptkb:German
|
gptkbp:field |
combinatorics
graph theory |
gptkbp:generalizes |
gptkb:Kőnig–Egerváry_theorem
|
https://www.w3.org/2000/01/rdf-schema#label |
König's theorem
|
gptkbp:namedAfter |
gptkb:Dénes_Kőnig
|
gptkbp:publicationYear |
1931
|
gptkbp:publishedIn |
gptkb:Mathematische_Annalen
|
gptkbp:relatedTo |
gptkb:Menger's_theorem
gptkb:Hall's_marriage_theorem 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:Cardinal_Arithmetic
|
gptkbp:bfsLayer |
5
|