arXiv:1602.02634 [math.CO]AbstractReferencesReviewsResources
Around the Complete Intersection Theorem
Published 2016-02-08Version 1
The celebrated theorem of Ahlswede and Khachatrian determines the maximum size of a family of $k$-element subsets of an $n$-element set where the intersection of any two subsets has at least $r$ elements. This survey first gives a historical introduction, then it shows some applications.
Related articles: Most relevant | Search more
arXiv:1604.06135 [math.CO] (Published 2016-04-20)
A tight stability version of the Complete Intersection Theorem
arXiv:1610.03027 [math.CO] (Published 2016-10-10)
On the union of intersecting families
arXiv:1708.02436 [math.CO] (Published 2017-08-08)
Subsets of posets minimising the number of chains