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:
“The statements of science are hearsay, reports from a world outside the world we know. What the poet tells us has long been known to us all, and forgotten. His knowledge is of our world, the world we are both doomed and privileged to live in, and it is a knowledge of ourselves, of the human condition, the human predicament.”
—John Hall Wheelock (1886–1978)
“Some collaboration has to take place in the mind between the woman and the man before the art of creation can be accomplished. Some marriage of opposites has to be consummated. The whole of the mind must lie wide open if we are to get the sense that the writer is communicating his experience with perfect fullness.”
—Virginia Woolf (1882–1941)
“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)