In combinatorial mathematics, Hall's marriage theorem, or simply Hall's Theorem, gives a necessary and sufficient condition for being able to select a distinct element from each of a collection of finite sets. It was proved by Philip Hall (1935).
Read more about Hall's Marriage Theorem: Definitions and Statement of The Theorem, Discussion and Examples, Graph Theoretic Formulation, Proof of The Graph Theoretic Version, Marshall Hall Jr. Variant, Applications, Marriage Condition Does Not Extend, Logical Equivalences
Famous quotes containing the words hall, marriage and/or theorem:
“While there we heard the Indian fire his gun twice.... This sudden, loud, crashing noise in the still aisles of the forest, affected me like an insult to nature, or ill manners at any rate, as if you were to fire a gun in a hall or temple.”
—Henry David Thoreau (1817–1862)
“It appears that ordinary men take wives because possession is not possible without marriage, and that ordinary women accept husbands because marriage is not possible without possession; with totally differing aims the method is the same on both sides.”
—Thomas Hardy (1840–1928)
“To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
—Albert Camus (1913–1960)