Source: wikibot/denes-konig
= Dénes Kőnig
{wiki=Dénes_Kőnig}
Dénes Kőnig is a prominent Hungarian mathematician known for his contributions to combinatorial mathematics, particularly in graph theory. He is best known for the "Kőnig's theorem," which is a fundamental result in bipartite graphs, stating that in any bipartite graph, the size of the maximum matching is equal to the size of the minimum vertex cover.