English Erdős–Ko–Rado theorem Cited by user David Eppstein on 23 Aug 2022 In combinatorics, the Erdős–Ko–Rado theorem of Paul Erdős, Chao Ko, and Richard Rado is a theorem bounding the size of intersecting families of sets.