Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03345912n
Noun Named Entity
Categories: Bipartite graphs, Perfect graphs, Theorems in graph theory, Matching
EN
König's theorem  Kőnig's theorem  Koenig's theorem  Koenig theorem  Konig's theorem
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
Definitions
Relations
Sources
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
Theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs Wikidata
IS A
theorem
NAMED AFTER
Dénes Kőnig
PROVED BY
Dénes Kőnig
Wikipedia
EN
Kőnig's theorem (graph theory)
Wikidata
EN
König's theorem
Wikipedia Redirections
EN
Koenig's theorem (graph theory), Koenig theorem (graph theory), Konig's theorem (graph theory), Konig-egervary, Konig property, Konig theorem (graph theory), König's theorem (graph theory), König-Egerváry theorem, König-Egeváry Theorem, König theorem (graph theory), König–Egerváry theorem, Kőnig's theorem, Kőnig-Egerváry theorem, Kőnig–Egerváry theorem

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