Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Kőnig's theorem (graph theory)
open-in-new
<p>In the <a href="/facts/Mathematics/pxTouaz4">mathematical</a> area of <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, Kőnig's theorem, proved by <a href="/facts/D%C3%A9nes_K%C5%91nig/wNMBmsYK">Dénes Kőnig</a> (1931), describes an equivalence between the <a href="/facts/Maximum_matching/oKaChmBt">maximum matching</a> problem and the minimum <a href="/facts/Vertex_cover_problem/WK86bJvf">vertex cover problem</a> in <a href="/facts/Bipartite_graph/xWcXV9MB">bipartite graphs</a>. It was discovered independently, also in 1931, by <a href="/facts/Jen%C5%91_Egerv%C3%A1ry/mYKIXmsI">Jenő Egerváry</a> in the more general case of <a href="/facts/Weighted_graph/W0MqKkyE">weighted graphs</a>. </p>