Date of Original Version
© Cambridge University Press
Abstract or Description
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how large it (G) could be in graphs with minimum degree at least δ. They further conjectured that when n ≥ 2δ and t ≥ 3, it (G) is maximized by the complete bipartite graph Kδ,n−δ . This conjecture has recently drawn the attention of many researchers. In this short note, we prove this conjecture.
Combinatorics, Probability and Computing, 24, 3, 521-527.