On the $4$-clique cover number of graphs

Yihan Chen, Jialin He, Tianying Xie

In 1966, Erdős, Goodman, and Pósa proved that $\lfloor n^2/4\rfloor$ cliques are sufficient to cover all edges in any $n$-vertex graph, with tightness achieved by the balanced com…