Skip to main content

Maximizing the Number of Independent Sets of a Fixed Size


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.

Hide All
[1]Alexander, J., Cutler, J. and Mink, T. (2012) Independent sets in graphs with given minimum degree. Electron. J. Combin. 19 P37.
[2]Alexander, J. and Mink, T. (2013) A new method for enumerating independent sets of a fixed size in general graphs. arXiv:1308.3242
[3]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 6071.
[4]Engbers, J. and Galvin, D. (2014) Counting independent sets of a fixed size in graphs with a given minimum degree. J. Graph Theory 76 149168.
[5]Galvin, D. (2011) Two problems on independent sets in graphs. Discrete Math. 311 21052112.
[6]Kahn, J. (2001) An entropy approach to the hard-core model on bipartite graphs. Combin. Probab. Comput. 10 219237.
[7]Katona, G. (1968) A theorem of finite sets. In Theory of Graphs: Proc. Colloq., Tihhany, 1966, Academic Press, pp. 187207.
[8]Kruskal, J. B. (1964) The number of simplices in a complex. In Mathematical Optimization Techniques (Bellman, R., ed.), University of California Press, pp. 251278.
[9]Law, H. and McDiarmid, C. (2013) On independent sets in graphs with given minimum degree. Combin. Probab. Comput. 22 874884.
[10]Lovász, L. (2007) Combinatorial Problems and Exercises, AMS.
[11]Sauvé, I. L. (1961) On chromatic graphs. Amer. Math. Monthly 68 107111.
[12]Zhao, Y. (2010) The number of independent sets in a regular graph. Combin. Probab. Comput. 19 109112.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed