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:
“Chipmunks jump, and
Greensnakes slither.
Rather burst than
Not be with her.”
—Donald Hall (b. 1928)
“Every marriage tends to consist of an aristocrat and a peasant. Of a teacher and a learner.”
—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)