A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A k-uniform family of subsets of [n] is intersecting if it does not contain a disjoint pair of sets. The study of intersecting families is central to extremal set theory, dating back to the seminal Erdős-Ko-Rado theorem of 1961 that bounds the size of the largest such families. A recent trend has been to investigate the structure of set families with few disjoint pairs. Friedgut and Regev proved a general removal lemma, showing that when γ n < k < (12 - γ)n, a set family with few disjoint pairsarXiv:1412.7885v3 fatcat:vzugstetpjf3tfnrdlzlyt7mpu