English

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

Combinatorics 2022-11-09 v1

Abstract

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

Keywords

Cite

@article{arxiv.2211.04081,
  title  = {A note on distinct differences in $t$-intersecting families},
  author = {Jagannath Bhanja and Sayan Goswami},
  journal= {arXiv preprint arXiv:2211.04081},
  year   = {2022}
}
R2 v1 2026-06-28T05:24:12.252Z