Also known as Hall's theorem
theorem that a finite bipartite graph has a perfect matching iff any subset of vertices from one group has a neighbourhood of equal or greater size
via Wikidata · CC0
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).