Best possible bounds on the number of distinct differences in intersecting families
For a family ā±, let š(ā±) stand for the family of all sets that can be expressed as Fā G, where F,Gāā±. A family ā± is intersecting if any two sets from the family have non-empty intersection. In this paper, we study the following question: what is the maximum of |š(ā±)| for an intersecting family of k-element sets? Frankl conjectured that the maximum is attained when ā± is the family of all sets containing a fixed element. We show that this holds if n>50klog k and k>50. At the same time, we provide a counterexample for n< 4k.
READ FULL TEXT