The Turán number and probabilistic combinatorics

DOI10.4169/AMER.MATH.MONTHLY.119.06.510zbMATH Open1259.05182arXiv1104.4735OpenAlexW133247014MaRDI QIDQ4908545FDOQ4908545

Authors: Alan J. Aw 

Publication date: 6 March 2013

Published in: The American Mathematical Monthly (Search for Journal in Brave)

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'{a}n number $T(n,k,l)$. Surprisingly, this proof cannot be found in existing literature.

Full work available at URL: https://arxiv.org/abs/1104.4735

Recommendations

• scientific article; zbMATH DE number 3258853
• scientific article; zbMATH DE number 15668
• scientific article; zbMATH DE number 981678
• Turan's Graph Theorem
• scientific article; zbMATH DE number 4108812

zbMATH Keywords

probabilistic method

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: The Turán number and probabilistic combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4908545)