Algorithms and Hardness Results for the $(k,\ell )$-Cover Problem

Amirali Madani, Anil Maheshwari, Babak Miraftab +1

A connected graph has a $(k,\ell )$-cover if each of its edges is contained in at least $\ell$ cliques of order $k$. Motivated by recent advances in extremal combinatorics and the l…