arXiv Analytics

Sign in

arXiv:2211.04081 [math.CO]AbstractReferencesReviewsResources

A note on distinct differences in $t$-intersecting families

Jagannath Bhanja, Sayan Goswami

Published 2022-11-08Version 1

For a family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$, let $\mathcal{D}(\mathcal{F}) = \{F\setminus G: F, G \in \mathcal{F}\}$ be the collection of all (setwise) differences of $\mathcal{F}$. The family $\mathcal{F}$ is called a $t$-intersecting family, if for some positive integer $t$ and any two members $F, G \in \mathcal{F}$ we have $|F\cap G| \geq t$. The family $\mathcal{F}$ is simply called intersecting if $t=1$. Recently, Frankl proved an upper bound on the size of $\mathcal{D}(\mathcal{F})$ for the intersecting families $\mathcal{F}$. In this note we extend the result of Frankl to $t$-intersecting families.

Related articles: Most relevant | Search more
arXiv:2106.05355 [math.CO] (Published 2021-06-09)
Best possible bounds on the number of distinct differences in intersecting families
arXiv:1408.3292 [math.CO] (Published 2014-08-14, updated 2014-11-18)
On the Erdos-Ko-Rado Theorem and the Bollobas Theorem for t-intersecting families
arXiv:1108.3207 [math.CO] (Published 2011-08-16)
Compressions and Probably Intersecting Families