The independent set sequence of some families of trees
Abstract
For a tree , let be the number of independent sets of size in . It is an open question, raised by Alavi, Malde, Schwenk and Erd\H{o}s, whether the sequence is always unimodal. Here we answer the question in the affirmative for some recursively defined families of trees, specifically paths with auxiliary trees dropped from the vertices in a periodic manner. In particular, extending a result of Wang and B.-X. Zhu, we show unimodality of the independent set sequence of a path on vertices with and pendant edges dropped alternately from the vertices of the path, arbitrary. We also show that the independent set sequence of any tree becomes unimodal if sufficiently many pendant edges are dropped from any single vertex, or if pendant edges are dropped from every vertex, for sufficiently large . This in particular implies the unimodality of the independent set sequence of some non-periodic caterpillars.
Keywords
Cite
@article{arxiv.1701.02204,
title = {The independent set sequence of some families of trees},
author = {David Galvin and Justin Hilyard},
journal= {arXiv preprint arXiv:1701.02204},
year = {2017}
}
Comments
Some minor corrections. To appear in Australas. J. Combin volume 70 issue 2 (2018)