A family of subsets of {1, . . . , n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdős, Ko, and Rado determines the maximum size of an intersecting family of k-subsets of {1, . . . , n}. In this paper we study the following problem: how many intersecting families of k-subsets of {1, . . . , n} are there? Improving a result of Bal...
