Sharp lower bounds and extremal graphs for the generalized $k$-independence number

Jing Huang, Jiaxin Tang

A vertex set $S$ is a generalized $k$-independent set if the induced subgraph $G[S]$ contains no tree on $k$ vertices. The generalized $k$-independence number ${\alpha }_k(G)$ is the maxim…