Clique covering of graphs
The clique covering number cc(G) of a graph G is the least number of complete subgraphs of G necessary to cover the edge set of G. The author shows that there exists an integer \(n_ 0\) such that for all graphs G on \(n>n_ 0\) vertices \(\max \{cc(G)+cc(\bar G)\}=\lfloor n^ 2/4\rfloor +2.\) This settles a conjecture of Erdős.
scientific article; zbMATH DE number 4043874