You are not currently logged in.

Access JSTOR through your library or other institution:


Log in through your institution.

Journal Article

The Turán Number and Probabilistic Combinatorics

Alan J. Aw
The American Mathematical Monthly
Vol. 119, No. 6 (June‒July 2012), pp. 510-513
DOI: 10.4169/amer.math.monthly.119.06.510
Stable URL:
Page Count: 4
Were these topics helpful?
See something inaccurate? Let us know!

Select the topics that are inaccurate.

  • Download ($19.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
The Turán Number and Probabilistic Combinatorics
Preview not available


Abstract In this short expository article, we describe a mathematical tool called the probabilistic method, and illustrate its elegance and beauty through proving a few well-known results. Particularly, we give an unconventional probabilistic proof of a classical theorem concerning the Turán number T(n, k, l).

Page Thumbnails