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:
“Let us not be too much acquainted. I would have a man enter his house through a hall filled with heroic and sacred sculptures, that he might not want the hint of tranquillity and self-poise.”
—Ralph Waldo Emerson (1803–1882)
“The parent who loves his child dearly but asks for nothing in return might qualify as a saint, but he will not qualify as a parent. For a child who can claim love without meeting any of the obligations of love will be a self-centered child and many such children have grown up in our time to become petulant lovers and sullen marriage partners because the promise of unconditional love has not been fulfilled.”
—Selma H. Fraiberg (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)