Erdős–Ko–Rado theorem
Erdős–Ko–Rado theorem is a theorem on the maximum size of a family of pairwise intersecting sets.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 19, 2026 · revision 2484894808
- Described as
- theorem on the maximum size of a family of pairwise intersecting sets
- What it is
- theorem
- Named after
- Paul Erdős; Richard Rado
- Wikipedias with a page
- 6
Wikidata item Q718875 (wikidata.org/wiki/Q718875), public domain (CC0). Copied 2026-11-19.
What Wikipedia says · copied November 19, 2026 · revision 1384683505
In mathematics, the Erdős–Ko–Rado theorem limits the number of sets in a family of sets for which every two sets have at least one element in common. Paul Erdős, Chao Ko, and Richard Rado proved the theorem in 1938, but did not publish it until 1961. It is part of the field of combinatorics, and one of the central results of extremal set theory.
The theorem applies to families of sets that all have the same size, r, and are all subsets of some larger set of size n. One way to construct a family of sets with these parameters, each two sharing an element, is to choose a single element to belong to all the subsets, and then form all of the subsets of size r that contain the chosen element. The Erdős–Ko–Rado theorem states that when n is large enough for the problem to be nontrivial (n≥2r) this construction produces the largest possible intersecting families. When n=2r there are other equally-large families, but for larger values of n only the families constructed in this way can be largest.
The Erdős–Ko–Rado theorem can also be described in terms of hypergraphs or independent sets in Kneser graphs. Several analogous theorems apply to other kinds of mathematical object than sets, including linear subspaces, permutations, and strings. They again describe the largest possible intersecting families as being formed by choosing an element and forming the family of all objects that contain the chosen element.
From the Wikipedia article “Erdős–Ko–Rado theorem” (en.wikipedia.org/wiki/Erdős–Ko–Rado_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
