Construct · 1 fields · 1 citations

Erdős-Ko-Rado theorem: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed

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

Combinatorics

the bound that a family of pairwise intersecting k-element subsets of an n-set, with n at least 2k, has at most n-1 choose k-1 members.

In combinatorics, Erdős-Ko-Rado theorem refers to the bound that a family of pairwise intersecting k-element subsets of an n-set, with n at least 2k, has at most n-1 choose k-1 members. This meaning comes from Erdós (1961) in The Quarterly Journal of Mathematics.[1]

Unit
Recovery means
Measured by

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

See how Erdős-Ko-Rado theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

family3 fields · 3 citationsjingle · one word, three constructs

References

Erdós, P., KO, C., & Rado, R. (1961). Intersection Theorems for Systems of Finite Sets. The Quarterly Journal of Mathematics, 12(1), 313-320. https://doi.org/10.1093/qmath/12.1.313

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