: Mathématiques: Kőnig's theorem

graph theory > Kőnig's theorem

Kőnig's theorem

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))

http://data.loterre.fr/ark:/67375/PSR-NW7M0NW6-L

RDF/XML TURTLE JSON-LD

Loterre