Lower Bound for Independence Covering in $C_4$-Free Graphs

Michael Kuhn, Daniel Lokshtanov, Zachary Miller

An independent set in a graph $G$ is a set $S$ of pairwise non-adjacent vertices in $G$. A family $\mathcal{F}$ of independent sets in $G$ is called a $k$-independence covering fam…