On $(K_{q},k)$ stable graphs with minimum size-Abstract
Abstract
A graph $G$ is a $(K_{q},k)$ (vertex) stable graph if it contains a $K_{q}$ after deleting any subset of $k$ vertices. We give a characterization of $(K_{q},k)$ stable graphs with minimum size for $q=3,4,5$.