Strong stability of 3-wise t-intersecting families
Abstract
Let G be a family of subsets of an n-element set. The family G is called 3-wise t-intersecting if the intersection of any three subsets in G is of size at least t. For a real number p∈(0,1) we define the measure of the family by the sum of p|G|(1-p)n-|G| over all G∈ G. For example, if G consists of all subsets containing a fixed t-element set, then it is a 3-wise t-intersecting family with the measure pt. Let 0<p≤ 2/(4t+9-1), δ>0, and let G be a 3-wise t-intersecting family. It is known that the measure of G is at most pt. Suppose, moreover, that G has the measure at least (12+δ)pt. We show that, by choosing t sufficiently large depending on δ, the structure of G is one of (i) and (ii): (i) every subset in G contains a fixed t-element set, (ii) every subset in G contains at least t+2 elements from a fixed (t+3)-element set.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.