Intersecting families with minimum volume Original Research Article

We determine the minimum volume (sum of cardinalities) of an intersecting family of subsets of an n-set, given the size of the family, by solving a simple linear program. From this, we obtain a lower bound on the average size of the sets in an intersecting family. This answers a question of G.O.H. Katona, whose 60th birthday we celebrate with this result.