The minimum number of clique-saturating edges

Jialin He, Fuhong Ma, Jie Ma +1

Let $G$ be a $K_p$-free graph. We say $e$ is a $K_p$-saturating edge of $G$ if $e\notin E(G)$ and $G+e$ contains a copy of $K_p$. Denote by $f_p(n,e)$ the minimum number of $K_p$-…