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:
“He packs wool sheared in April, honey
in combs, linen, leather
tanned from deerhide,
and vinegar in a barrel
hooped by hand at the forge’s fire.”
—Donald Hall (b. 1928)
“That a marriage ends is less than ideal; but all things end under heaven, and if temporality is held to be invalidating, then nothing real succeeds.”
—John Updike (b. 1932)
“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)