Counting independent sets in cubic graphs of given girth

We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawood graph, the point/line incidence graph of the Fano plane. We also give a tight lower bound on the total number of independent sets of triangle-free cubic graphs. This bound is achieved by unions of the Petersen graph. We conjecture that in fact all Moore graphs are extremal for the scaled number of independent sets in regular graphs of a given minimum girth, maximizing this quantity if their girth is even and minimizing if odd. The Heawood and Petersen graphs are instances of this conjecture, along with complete graphs, complete bipartite graphs, and cycles.

[1]  Stefan Adams,et al.  The Widom-Rowlinson model on the Delaunay graph , 2017, Electronic Journal of Probability.

[2]  B. Roberts,et al.  On the average size of independent sets in triangle-free graphs , 2016, 1606.01043.

[3]  Prasad Tetali,et al.  On Weighted Graph Homomorphisms , 2001, Graphs, Morphisms and Statistical Physics.

[4]  Jonathan Cutler,et al.  Minimizing the number of independent sets in triangle-free regular graphs , 2018, Discret. Math..

[5]  Jeff Kahn,et al.  An Entropy Approach to the Hard-Core Model on Bipartite Graphs , 2001, Combinatorics, Probability and Computing.

[6]  A. D. Forbes,et al.  On independent sets , 2005 .

[7]  Will Perkins,et al.  The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph , 2017, Eur. J. Comb..

[8]  Pak-Ken Wong,et al.  Cages - a survey , 1982, J. Graph Theory.

[9]  Kathryn Fraughnaugh Jones.  Independence in graphs with maximum degree four , 1984, J. Comb. Theory, Ser. B.

[10]  W. Staton.  Some Ramsey-type numbers and the independence ratio , 1979 .

[11]  Yufei Zhao.  Extremal Regular Graphs: Independent Sets and Graph Homomorphisms , 2016, Am. Math. Mon..

[12]  Will Perkins,et al.  Extremes of the internal energy of the Potts model on cubic graphs , 2016, Random Struct. Algorithms.

[13]  Will Perkins,et al.  On the Widom-Rowlinson Occupancy Fraction in Regular Graphs , 2017, Comb. Probab. Comput..

[14]  Will Perkins,et al.  Independent sets, matchings, and occupancy fractions , 2015, J. Lond. Math. Soc..

[15]  Jonathan Cutler,et al.  The maximum number of complete subgraphs in a graph with given maximum degree , 2014, J. Comb. Theory, Ser. B.