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:
“I was afraid the waking arm would break
From the loose earth and rub against his eyes
A fist of trees, and the whole country tremble
In the exultant labor of his rise;”
—Donald Hall (b. 1928)
“We have seen that men are learning that work, productivity, and marriage may be very important parts of life, but they are not its whole cloth. The rest of the fabric is made of nurturing relationships, especially those with children—relationships which are intimate, trusting, humane, complex, and full of care.”
—Kyle D. Pruett (20th century)
“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)