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:
“For a hundred and fifty years, in the pasture of dead horses,
roots of pine trees pushed through the pale curves of your ribs,
yellow blossoms flourished above you in autumn, and in winter
frost heaved your bones in the ground—old toilers, soil makers:
O Roger, Mackerel, Riley, Ned, Nellie, Chester, Lady Ghost.”
—Donald Hall (b. 1928)
“In almost every marriage there is a selfish and an unselfish partner. A pattern is set up and soon becomes inflexible, of one person always making the demands and one person always giving way.”
—Iris Murdoch (b. 1919)
“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)