On a Turán type problem of Erdős (Q1180412)

For a given graph \(F\) are presented upper and lower bounds for the maximum number of edges of a graph with \(n\) vertices not containing \(F\) as a subgraph. Extracted are the cases when \(F\) is a kind of bipartite graph. The cases permitting exact values of this variable the author is going to publish separately. The article mentions that the problem is connected with the problem of the determination of the chromatic number of \(F\).