The EKR theorem, which is the cornerstone of extremal
combinatorics, characterizes maximal intersecting families of sets.
Its setting fixes a ground set of size n, and then studies the size
and structure of intersecting families of subsets of fixed...
