New approach to the $k$-independence number of a graph

Yair Caro, Adriana Hansberg

Let $G=(V,E)$ be a graph and $k\ge 0$ an integer. A $k$-independent set $S\subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most…