Clique covering of graphs

AbstractLet cc(G) denote the least number of complete subgraphs necessary to cover the edges of a graphG. Erdős conjectured that for a graphG onn vertices $$cc(G) + cc(\bar G) \leqq \frac{1}{4}n^2 + 2$$ ifn is sufficiently large. We prove this conjecture.