Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03345912n
Noun Named Entity
SYL
No term available
EN
In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig, describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Wikipedia
English:
graph theory
Relations
Sources
IS A
EN
theorem
NAMED AFTER
Dénes könig
PROVED BY
Dénes könig

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License