A note on distinct differences in t-intersecting families
Abstract
For a family F of subsets of \1,2,…,n\, let D(F) = \F G: F, G ∈ F\ be the collection of all (setwise) differences of F. The family F is called a t-intersecting family, if for some positive integer t and any two members F, G ∈ F we have |F G| ≥ t. The family F is simply called intersecting if t=1. Recently, Frankl proved an upper bound on the size of D(F) for the intersecting families F. In this note we extend the result of Frankl to t-intersecting families.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.