Hall's marriage theorem

E1679172 UNEXPLORED

Hall's marriage theorem is a fundamental result in combinatorics and graph theory that gives a necessary and sufficient condition for the existence of a perfect matching in bipartite graphs.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Hall's marriage theorem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Birkhoff–von Neumann theorem → relatedTo → Hall's marriage theorem ⓘ