English

Strong stability of 3-wise $t$-intersecting families

Combinatorics 2024-02-16 v3

Abstract

Let G{\mathcal G} be a family of subsets of an nn-element set. The family G{\mathcal G} is called 33-wise tt-intersecting if the intersection of any three subsets in G{\mathcal G} is of size at least tt. For a real number p(0,1)p\in(0,1) we define the measure of the family by the sum of pG(1p)nGp^{|G|}(1-p)^{n-|G|} over all GGG\in{\mathcal G}. For example, if G{\mathcal G} consists of all subsets containing a fixed tt-element set, then it is a 33-wise tt-intersecting family with the measure ptp^t. Let 0<p2/(4t+91)0<p\leq 2/(\sqrt{4t+9}-1), δ>0\delta>0, and let G{\mathcal G} be a 33-wise tt-intersecting family. It is known that the measure of G{\mathcal G} is at most ptp^t. Suppose, moreover, that G{\mathcal G} has the measure at least (12+δ)pt(\frac12+\delta)p^t. We show that, by choosing tt sufficiently large depending on δ\delta, the structure of G{\mathcal G} is one of (i) and (ii): (i) every subset in G{\mathcal G} contains a fixed tt-element set, (ii) every subset in G{\mathcal G} contains at least t+2t+2 elements from a fixed (t+3)(t+3)-element set.

Keywords

Cite

@article{arxiv.2304.13466,
  title  = {Strong stability of 3-wise $t$-intersecting families},
  author = {Norihide Tokushige},
  journal= {arXiv preprint arXiv:2304.13466},
  year   = {2024}
}