No label defined (Q5610919)

[For the entire collection see Zbl 0205.00201.] The authors prove several results on extremal graphs and state several unsolved problems. Here we only state one theorem. Let \(C\) be the graph of 8 vertices and 12 edges determined by the vertices and edges of a cube. The authors prove that every graph of \(n\) vertices and \(c_1n^{8/5}\) edges contains \(C\) as a subgraph. It is an unsolved problem if this theorem is best possible. In other words we do not know if there is a graph of \(n\) vertices and \(c_2n^{8/5}\) edges which does not contain \(C\) as a subgraph.