Abstract: Given two integers n and r, the Turan problem is about finding the maximum number of edges in any graph of order n, which does not contain the complete graph of order r as a subgraph. In this talk we discuss this problem and its numerous variants.