Rainbow independent sets in graphs with maximum degree two

Yue Ma, Xinmin Hou, Jun Gao +2

Given a graph $G$, let $f_G(n,m)$ be the minimal number $k$ such that every $k$ independent $n$-sets in $G$ have a rainbow $m$-set. Let $\mathcal{D}(2)$ be the family of all grap…