Forbidden subgraph problem

Problem

In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph $G$, find the maximal number of edges $\operatorname{ex}(n,G)$ an $n$-vertex graph can have such that it does not have a subgraph isomorphic to $G$. In this context, $G$ is called a forbidden subgraph.