König's theorem
theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs
Press Enter · cited answer in seconds
0 sources
König's theorem
Summary
König's theorem is a theorem[1]. It draws 148 Wikipedia views per month (theorem category, ranking #205 of 1,306).[2]
Key Facts
- König's theorem's instance of is recorded as theorem[3].
- Dénes Kőnig is named after König's theorem[4].
- König's theorem's part of is recorded as list of theorems[5].
- König's theorem's Freebase ID is recorded as /m/0dn1zp[6].
- König's theorem's proved by is recorded as Dénes Kőnig[7].
- König's theorem's Encyclopædia Britannica Online ID is recorded as topic/Konigs-theorem[8].
- König's theorem's defining formula is recorded as \nu(G)=\tau(G)[9].
- König's theorem's MathWorld ID is recorded as Koenig-EgevaryTheorem[10].
- König's theorem's maintained by WikiProject is recorded as WikiProject Mathematics[11].
- König's theorem's in defining formula is recorded as \nu(G)[12].
- König's theorem's in defining formula is recorded as \tau(G)[13].
- König's theorem's in defining formula is recorded as G[14].
Why It Matters
König's theorem draws 148 Wikipedia views per month (theorem category, ranking #205 of 1,306).[2] It has Wikipedia articles in 11 language editions, a strong signal of global cultural recognition.[15] It is known by 12 alternative names across languages and contexts.[16]