Also known as König–Hall theorem, König–Egerváry theorem
theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).