The independent set sequence of some families of trees

Abstract

For a tree T, let iT(t) be the number of independent sets of size t in T. It is an open question, raised by Alavi, Malde, Schwenk and Erdos, whether the sequence (iT(t))t ≥ 0 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 2n vertices with 1 and 2 pendant edges dropped alternately from the vertices of the path, 1, 2 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 k pendant edges are dropped from every vertex, for sufficiently large k. This in particular implies the unimodality of the independent set sequence of some non-periodic caterpillars.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…