Concept information
Preferred term
Kőnig's theorem
Definition(s)
-
In the mathematical area of graph theory, Kőnig's theorem, proved by Dénes Kőnig (1931), describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. It was discovered independently, also in 1931, by Jenő Egerváry in the more general case of weighted graphs.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/K%C5%91nig%27s_theorem_(graph_theory))
Broader concept(s)
In other languages
-
French
URI
http://data.loterre.fr/ark:/67375/PSR-NW7M0NW6-L
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}