I will discuss the enumeration of independent sets on graphs with various restrictions. In particular, I will look at the graph which maximizes the number of independent sets amongst all bipartite graphs on n vertices with minimum degree at least δ.