On the number of edge disjoint cliques in graphs of given size.

In this paper, we prove that any graph of n vertices and t( n)+ m edges, where t( n) is the Turán number, contains (1− o(1) m edge disjoint K'sif m= o( n). Furthermore, we determine the maximum m such that every graph of n vertices and t( n)+ m edges contains m edge disjoint K's if n is sufficiently large. [ABSTRACT FROM AUTHOR]