Premium
On the Structure of Edge Graphs II
Author(s) -
Bollobás B.,
Erdös P.,
Simonovits M.
Publication year - 1976
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/s2-12.2.219
Subject(s) - combinatorics , citation , mathematics , computer science , library science
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 Kd(ru ..., rd) be the complete dpartite graph with r{ vertices in its i-th class and put Kd(t) = Kd(t, ..., t), Kd = Kd(\). Given integers n ̂ d(^ 2), let md(n) be the minimal integer with the property that every G(n, m), where m ^ md(ri), contains a Kd. The function md(n) was determined by Turan [5]. It is easily seen that