Intersections ofk-element sets

Combinatorica volume 1, pages381–384(1981)Cite this article

Abstract

LetF be a collection ofk-element sets with the property that the intersection of no two should be included in a third. We show that such a collection of maximum size satisfies .2715k+o(k)≦≦log2 |F|≦.7549k+o(k) settling a question raised by Erdős. The lower bound is probabilistic, the upper bound is deduced via an entropy argument. Some open questions are posed.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

References

  1. [1]

    P. Erdős, private communication.

  2. [2]

    R. McEliece,The Theory of Information and Coding, Encyclopedia of Mathematics, Vol. 3, Addison-Wesley, Reading, Massachusetts, 1977.

    Google Scholar 

Download references

Author information

Affiliations

  1. Massachusetts Institute of Technology, 02 139, Cambridge, MA, U.S.A.

    D. J. Kleitman, J. Shearer & D. Sturtevant

Authors
  1. D. J. Kleitman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Shearer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Sturtevant
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been supported in part by the Office of Naval Research under Contract N00014-76-C-0366.

Supported in part by a NSF postdoctoral Fellowship.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kleitman, D.J., Shearer, J. & Sturtevant, D. Intersections ofk-element sets. Combinatorica 1, 381–384 (1981). https://doi.org/10.1007/BF02579460

Download citation

AMS subject classification (1980)

  • 05 C 65
  • 05 C 35