Independent Sets in n-vertex k-chromatic, \ell-connected graphs

John Engbers, Lauren Keough, Taylor Short

We study the problem of maximizing the number of independent sets in $n$-vertex $k$-chromatic $\ell$-connected graphs. First we consider maximizing the total number of independent…