On saturation problems involving clique number and matching number

Zian Chen, Guorong Gao, Jianfeng Hou +1

For a clique $K_r$, a graph is $K_r$-saturated if it contains no copy of $K_r$ and the addition of any edge from its complement creates a $K_r$. A classical result of Erdős-Hajnal…