Construct · 1 fields · 1 citations

Hall's marriage theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Hall's marriagetheorem1 CONSTRUCTHall's marriage theoremHALL · COMBINATORICS

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorics

the condition that a family of sets has a system of distinct representatives exactly when every k of the sets together contain at least k elements.

In combinatorics, Hall's marriage theorem refers to the condition that a family of sets has a system of distinct representatives exactly when every k of the sets together contain at least k elements. This meaning comes from Hall (1935) in Journal of the London Mathematical Society.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Hall's marriage theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

condition2 fields · 2 citationsjingle · one word, two constructsfamily3 fields · 3 citationsjingle · one word, three constructs

References

  1. Hall, P. (1935). On Representatives of Subsets. Journal of the London Mathematical Society, s1-10(1), 26-30. https://doi.org/10.1112/jlms/s1-10.37.26

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct