Alexander, J., Cutler, J. and Mink, T. (2012) Independent sets in graphs with given minimum degree. Electron. J. Combin. 19 P37.
Alexander, J. and Mink, T. (2013) A new method for enumerating independent sets of a fixed size in general graphs. arXiv:1308.3242
Cutler, J. and Radcliffe, A. J. (2013) The maximum number of complete subgraphs in a graph with given maximum degree. J. Combin. Theory Ser. B 104 60–71.
Engbers, J. and Galvin, D. (2014) Counting independent sets of a fixed size in graphs with a given minimum degree. J. Graph Theory 76 149–168.
Galvin, D. (2011) Two problems on independent sets in graphs. Discrete Math. 311 2105–2112.
Kahn, J. (2001) An entropy approach to the hard-core model on bipartite graphs. Combin. Probab. Comput. 10 219–237.
Katona, G. (1968) A theorem of finite sets. In Theory of Graphs: Proc. Colloq., Tihhany, 1966, Academic Press, pp. 187–207.
Kruskal, J. B. (1964) The number of simplices in a complex. In Mathematical Optimization Techniques (Bellman, R., ed.), University of California Press, pp. 251–278.
Law, H. and McDiarmid, C. (2013) On independent sets in graphs with given minimum degree. Combin. Probab. Comput. 22 874–884.
Lovász, L. (2007) Combinatorial Problems and Exercises, AMS.
Sauvé, I. L. (1961) On chromatic graphs. Amer. Math. Monthly 68 107–111.
Zhao, Y. (2010) The number of independent sets in a regular graph. Combin. Probab. Comput. 19 109–112.