On the dissociation number of Kneser graphs

Boštjan Brešar, Tanja Dravec

A set $D$ of vertices of a graph $G$ is a dissociation set if each vertex of $D$ has at most one neighbor in $D$. The dissociation number of $G$, $diss(G)$, is the cardinality of a…