On the Structure of Edge Graphs II
B Bollobás, P. Erdös, Miklós Simonovits · Journal of the London Mathematical Society · 1976
This note is a sequel to [1].First let us recall some of the notations.Denote by G{n, m) a graph with n vertices and m edges.Let K d (r u ..., r d ) be the complete dpartite graph with r { vertices in its i-th class and put K d (t) = K d (t, ..., t), K d = K d (\).Given integers n ^ d(^ 2), let m d (n) be the minimal integer with the property that every G(n, m), where m ^ m d (ri), contains a K d .The function m d (n) was determined by Turan [5].It is easily seen that