Skip to main content
Log in

A Common Generalization to Theorems on Set Systems with L-intersections

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

In this paper, we provide a common generalization to the well-known Erdös–Ko–Rado Theorem, Frankl–Wilson Theorem, Alon–Babai–Suzuki Theorem, and Snevily Theorem on set systems with L-intersections. As a consequence, we derive a result which strengthens substantially the well-known theorem on set systems with k-wise L-intersections by Füredi and Sudakov [J. Combin. Theory, Ser. A, 105, 143–159 (2004)]. We will also derive similar results on L-intersecting families of subspaces of an n-dimensional vector space over a finite field F q , where q is a prime power.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alon, N., Babai, L., Suzuki, H.: Multilinear polynomials and Frankl–Ray–Chaudhuri–Wilson type intersection theorems. J. Combin. Theory, Ser. A, 58, 165–180 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bollobás, B., Duchet, P.: Helly families of maximal size. J. Combin. Theory, Ser. A, 26, 197–200 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Deza, M., Frankl, P.: Erdös–Ko–Rado theorem-22 years later. SIAM J. Algebraic Discrere Math., 4, 419–431 (1983)

    Article  MATH  Google Scholar 

  4. Erdös, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Q. J. Math. Oxford (2), 12, 313–320 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  5. Frankl, P.: The Erdös–Ko–Rado theorem is true for n = ckt. Proc. Fifth Hung. Comb. Coll., North-Holland, Amsterdam, 1978, 365–375

    Google Scholar 

  6. Frankl, P., Füredi, Z.: Families of finite sets with missing intersections. Collq. Math. Soc. János Bolyai, 37, 305–320 (1981)

    MathSciNet  MATH  Google Scholar 

  7. Frankl, P., Graham, R. L.: Intersection theorems for vector spaces. Europ. J. Combin., 6, 183–187 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  8. Frankl, P., Wilson, R. M.: Intersection theorems with geometric consequences. Combinatorica, 1, 357–368 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  9. Füredi, Z., Sudakov, B.: Extremal set systems with restricted k-wise intersections. J. Combin. Theory, Ser. A, 105, 143–159 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Greene, C., Kleitman, D. J.: Proof techniques in the theory of finite sets. In: MAA Studies in Math., 17, 1978, 12–79

    MathSciNet  MATH  Google Scholar 

  11. Grolmusz, V., Sudakov, B.: On k-wise set-intersections and k-wise hamming-distances. J. Combin. Theory, Ser. A, 99, 180–190 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hegedűs, G.: A generalization of the Erdös–Ko–Rado theorem. Austr. J. Combin., 66(2), 256–264 (2016)

    MATH  Google Scholar 

  13. Hsieh, W. N.: Intersection theorems for systems of finite vector spaces. Discrete Math., 12, 1–16 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lefmann, H.: On families in finite lattices. Europ. J. Combin., 11, 165–179 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Liu, J., Liu, X.: Set systems with positive intersection sizes. Discrete Math., 340, 2333–2340 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Liu, J., Yang, W.: Set systems with restricted k-wise L-intersections modulo a prime number. Europ. J. Combin., 36, 707–719 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  17. Qian, J., Ray-Chaudhuri, D. K.: Extremal case of Frankl–Ray–Chaudhuri–Wilson inequality. J. Statist. Plann. Inference, 95(1-2), 293–306 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Qian, J., Ray-Chaudhuri, D. K.: Frankl–Füredi type inequalities for polynomial semi-lattices. Electron. J. Combin., 4(1), R28, (1997)

    MATH  Google Scholar 

  19. Ray Chaudhuri, D. K., Wilson, R. M.: On t-designs. Osaca J. Math., 12, 737–744 (1975)

    MATH  Google Scholar 

  20. Ray-Chaudhuri, D. K., Zhu, T.: S-intersection families and tight designs. Coding Theory, Design Theory, Group Theory, Proceeding of Marshall Hall Conference, Wiley, New York, 67–75 (1993)

    Google Scholar 

  21. Snevily, H. S.: A sharp bound for the number of sets that pairwise intersect at k positive values. Combinatorica, 23, 527–533 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  22. Snevily, H. S.: On generalizations of the deBruiji–Erdös theorem. J. Combin. Theory, Ser. A, 68, 232–238 (1994)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiu Qiang Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, J.Q., Zhang, S.G. & Xiao, J.M. A Common Generalization to Theorems on Set Systems with L-intersections. Acta. Math. Sin.-English Ser. 34, 1087–1100 (2018). https://doi.org/10.1007/s10114-018-6577-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-018-6577-0

Keywords

MR(2010) Subject Classification

Navigation