Erdős–Ko–Rado Theorem

Determines the maximum cardinality of a family of k-element subsets of an n-element set such that every pair of subsets in the family has nonempty intersection; in the classical form, when n ≥ 2k the maximum size is the number of k-subsets containing a fixed element.