arXiv Analytics

Sign in

arXiv:2304.13466 [math.CO]AbstractReferencesReviewsResources

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

Norihide Tokushige

Published 2023-04-26Version 1

Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called $3$-wise $t$-intersecting if the intersection of any three subsets in $\mathcal G$ is of size at least $t$. For a real number $p\in(0,1)$ we define the measure of the family by the sum of $p^{|G|}(1-p)^{n-|G|}$ over all $G\in\mathcal G$. For example, if $\mathcal G$ consists of all subsets containing a fixed $t$-element set, then it is a $3$-wise $t$-intersecting family with the measure $p^t$. For a given $\delta>0$, by choosing $t$ sufficiently large, the following holds for all $p$ with $0<p\leq 2/(\sqrt{4t+9}-1)$. If $\mathcal G$ is a $3$-wise $t$-intersecting family with the measure at least $(\frac12+\delta)p^t$, then $\mathcal G$ satisfies one of (i) and (ii): (i) every subset in $\mathcal G$ contains a fixed $t$-element set, (ii) every subset in $\mathcal G$ contains at least $t+2$ elements from a fixed $(t+3)$-element set.

Related articles: Most relevant | Search more
arXiv:1610.03027 [math.CO] (Published 2016-10-10)
On the union of intersecting families
arXiv:1210.7470 [math.CO] (Published 2012-10-28)
EKR sets for large $n$ and $r$
arXiv:2211.11341 [math.CO] (Published 2022-11-21)
An improved threshold for the number of distinct intersections of intersecting families