MAX for $k$-independence in multigraphs

Nevena Francetić, Sara Herke, Daniel Horsley

For a fixed positive integer $k$, a set $S$ of vertices of a graph or multigraph is called a $k$-independent set if the subgraph induced by $S$ has maximum degree less than $k$. Th…