Gabriel Currier

The classical Erdos-Ko-Rado theorem in extremal combinatorics states the following: Given a family F of k-subsets of an n-set that is "pairwise intersecting" (meaning A \cap B \neq \emptyset for all A,B in F) it follows that F can be no larger than...