  The clique cover number of a graph G is the minimum number of cliques
required to cover the edges of graph G. In this paper we consider the random
graph G(n,p), for p constant. We prove that with probability 1-o(1), the clique
number of G(n,p) is Theta(n^2/\log^2n).
