THE MINIMUM NUMBER OF DISJOINT PAIRS IN SET SYSTEMS AND RELATED PROBLEMS

摘要

Let F be a set system on [n] with all sets having k elements and every pair of sets intersecting. The celebrated theorem of Erdos, Ko and Rado from 1961 says that, provided n >= 2k, any such system has size at most (