Some remarks on Ramsey ’ s and TurWs theorem

l.In this paper we are going to discuss some special cases of a gene?aI problem which might be considered as being on the one hand a generalisation of the problem raised and solved by the well-known theorem of Turan, on the other hand as the well known problem of the Ramsey-numbers. Before going to explain this in details, we give the notations we shall use: G(n) is a graph with n vertices GCn;e) is a graph with n vertices and e edges e(G) denotes the number of edges of G 6 is the complementary graph of G K(u) is the complete graph with v vertices H( n; k,C) is the class of G(n) graphs, where G(n) contains no K(k) and &t-t) contains no K(C)