On the Independent Set Sequence of a Tree

Alavi, Malde, Schwenk and Erdős asked whether the independent set sequence of every tree is unimodal. Here we make some observations about this question. We show that for the uniformly random (labelled) tree, asymptotically almost surely (a.a.s.) the initial approximately 49.5% of the sequence is increasing while the terminal approximately 38.8% is decreasing. Our approach uses the Matrix Tree Theorem, combined with computation. We also present a generalization of a result of Levit and Mandrescu, concerning the final one-third of the independent set sequence of a König-Egerváry graph. 

[1]  Yi Wang,et al.  The unimodality of independence polynomials of some graphs , 2007, Australas. J Comb..

[2]  Yahya Ould Hamidoune.  On the numbers of independent k-sets in a claw free graph , 1990, J. Comb. Theory, Ser. B.

[3]  Ferenc Bencs,et al.  On trees with real-rooted independence polynomial , 2017, Discret. Math..

[6]  George Polya,et al.  On The Product of Two Power Series , 1949, Canadian Journal of Mathematics.

[7]  I. Good.  Saddle-point Methods for the Multinomial Distribution , 1957 .

[8]  Jennifer Ryan,et al.  Bounds on the number of complete subgraphs , 1992, Discret. Math..

[9]  Steven Heilman,et al.  Independent Sets of Random Trees and of Sparse Random Graphs , 2020, ArXiv.

[10]  Yun Chen,et al.  Log-concavity of independence polynomials of some kinds of trees , 2019, Appl. Math. Comput..

[11]  Vadim E. Levit,et al.  On Unimodality of Independence Polynomials of Some Well-Covered Trees , 2003, DMTCS.

[12]  Danièle Gardy,et al.  Some results on the asymptotic behaviour of coefficients of large powers of functions , 1995, Discret. Math..

[13]  J. Moon,et al.  The expected node-independence number of random trees , 1973 .

[14]  Y. Alavi,et al.  The vertex independence sequence of a graph is not constrained , 1987 .

[15]  T. S. Michael,et al.  Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture , 2003, Graphs Comb..

[16]  S. D. Bedrosian.  Generating formulas for the number of trees in a graph , 1964 .

[17]  B. Pittel.  Normal convergence problem? Two moments and a recurrence may be the clues , 1999 .

[18]  Bao-Xuan Zhu,et al.  Unimodality of independence polynomials of rooted products of graphs , 2020, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.

[19]  The independent set sequence of some families of trees , 2017, 1701.02204.

[20]  Discussiones Mathematicae.  LOWER BOUND ON THE DOMINATION NUMBER OF A TREE , 2004 .

[21]  Bao-Xuan Zhu.  Clique cover products and unimodality of independence polynomials , 2016, Discret. Appl. Math..

[22]  P. Brand'en.  Unimodality, log-concavity, real-rootedness and beyond , 2014, 1410.6601.

[23]  Taylor Ball,et al.  Independent set and matching permutations , 2022, J. Graph Theory.

[24]  O. J. Heilmann,et al.  Theory of monomer-dimer systems , 1972 .

[25]  R. Stanley.  Log‐Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry a , 1989 .

[26]  Patrick Bahls,et al.  New families of graphs whose independence polynomials have only real roots , 2014, Australas. J Comb..