Matches in DBpedia 2014 for { ?s ?p 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).. }
Showing items 1 to 2 of
2
with 100 items per page.
- Hall's_marriage_theorem abstract "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).".
- Hall's_marriage_theorem comment "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).".