Log in

A Note on Distinct Differences in t-Intersecting Families

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

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 said to be a t-intersecting family for some positive integer t if \(|F\cap G| \ge t\) for all \(F, G \in \mathcal {F}\). 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price includes VAT (Germany)

Instant access to the full article PDF.

Similar content being viewed by others

Data Availability

All authors contributed equally to this article.

References

  1. Erdős, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Q. J. Math. 12, 310–320 (1961)

    Article  MathSciNet  Google Scholar 

  2. Frankl, P.: The Erdős–Ko–Rado theorem is true for \(n=ckt\). In: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthey, 1976), Vol. I, pp. 365–375. Colloq. Math. Soc. János Bolyai, 18, North-Holland, (1978)

  3. Frankl, P.: On the number of distinct differences in an intersecting family. Discrete Math. 344(2), 112210 (2021)

    Article  MathSciNet  Google Scholar 

  4. Frankl, P., Kiselev, S., Kupavskii, A.: Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Combin. 107, 103601 (2023)

    Article  MathSciNet  Google Scholar 

  5. Marica, J., Schönheim, J.: Differences of sets and a problem of graham. Can. Math. Bull. 12, 635–637 (1969)

    Article  MathSciNet  Google Scholar 

  6. Wilson, R.M.: The exact bound in the Erdős–Ko–Rado theorem. Combinatorica 4, 247–257 (1984)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Both of the authors are thankful to the referee for his/ her helpful comments on the previous draft of this paper. The second named author is supported by NBHM postdoctoral fellowship with reference no: 0204/27/(27)/2023/R & D-II/11927. This work was carried out when the authors were at the Institute of Mathematical Sciences in Chennai. Both authors wish to thank the Institute of Mathematical Sciences for the financial support they received through the institute’s postdoctoral program.

Funding

Both the authors received funding from IMSc during the preparation of this manuscript. The second author partially supported by NBHM postdoctoral fellowship.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sayan Goswami.

Ethics declarations

Conflict of interest

The authors have no relevant financial or non-financial interests to disclose.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bhanja, J., Goswami, S. A Note on Distinct Differences in t-Intersecting Families. Graphs and Combinatorics 40, 69 (2024). https://doi.org/10.1007/s00373-024-02799-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-024-02799-0

Keywords

Mathematics Subject Classification

Navigation