In this talk we will introduce a variation of the classical Turan problem of determining the maximum number of edges in an $n$-vertex graph that does not contain a fixed forbidden graph. We will present some results and open problems. The talk is intended for a general audience and should be accessible for advanced undergraduates.