According to Paul Erdős au][
Some notes on Turán’s mathematical work
, J. Approx. Theory
(1980), page 4]_it was Paul Turán who “created the area of extremal problems in graph theory”. However, without a doubt, Paul Erdős popularized
, by his many contributions to the field, his numerous questions and conjectures, and his influence on discrete mathematicians in Hungary and all over the world. In fact, most of the early contributions in this field can be traced back to Paul Erdős, Paul Turán, as well as their collaborators and students. Paul Erdős also established the
in discrete mathematics, and in collaboration with Alfréd Rényi, he started the systematic study of
. We shall survey recent developments at the interface of extremal combinatorics and random graph theory.