• Towards a general theory of Erdős-Ko-Rado combinatorics 

        Contributor:Lindzey, Nathan;
        Date Submitted:2014
        In 1961, Erdős, Ko, and Rado proved that for a universe of size n ≥ 2k a family of k-subsets whose members pairwise intersect cannot be larger than n-1/k-1. This fundamental result of extremal combinatorics is now known ...