The Kőnig's theorem cardKőnig's theorem

Kőnig's theorem

graph theory

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Kőnig's theorem (graph theory)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: David Eppstein, Public domain, via Wikimedia Commons.

Open free boosters and add Kőnig's theorem to your collection.

Play for free

Related cards