Counting independent sets of a fixed size in graphs with a given minimum degree

John Engbers, David Galvin

Galvin showed that for all fixed $\delta$ and sufficiently large $n$, the $n$-vertex graph with minimum degree $\delta$ that admits the most independent sets is the complete bipartite graph…