Threshold functions

Abstract

It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold function. This generalises a number of classical results in the theory of random graphs.

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

References

  1. [1]

    B. Bollobás,Random Graphs, Academic Press, London, 1985.

    Google Scholar 

  2. [2]

    G. Katona, A theorem of finite sets, in:Theory of Graphs (P. Erdös and G. Katona, eds), Academic Press, New York, 1968, 187–207.

    Google Scholar 

  3. [3]

    J. B. Kruskal, The number of simplices in a complex, in:Math. Optimization Techniques, Univ. Calif. Press, Berkeley and Los Angeles, 1963, 251–278.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

First author supported by NSF grant MCS 8104854

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bollobás, B., Thomason, A.G. Threshold functions. Combinatorica 7, 35–38 (1987). https://doi.org/10.1007/BF02579198

Download citation

AMS subject classification (1980)

  • 60 C 05
  • 05 C 30