# König's theorem

> theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs

**Wikidata**: [Q897769](https://www.wikidata.org/wiki/Q897769)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Kőnig's_theorem_(graph_theory))  
**Source**: https://4ort.xyz/entity/k-nig-s-theorem


## References

1. Freebase Data Dumps. 2013
2. [Source](https://homepages.cwi.nl/~lex/files/agt1.pdf)