The optimal bound on the 3-independence number obtainable from a polynomial-type method

Lord C. Kavi, Mike Newman

A $k$-independent set in a connected graph is a set of vertices such that any two vertices in the set are at distance greater than $k$ in the graph. The $k$-independence number of…