This note is a sequel to [1] . First let us recall some of the notations . Denote by G(n, in) a graph with n vertices and m edges. Let K d (r,, . . ., rd ) be the complete dpartite graph with r ; vertices in its i-th class and put K,(t) = K d (t, . . ., t), K d = Kd (1) . Given integers n > d(> 2), let in d(n) be the minimal integer with the property that every G(n, in), where an > na d (n), co...