{"paper":{"title":"The independent set sequence of some families of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, Justin Hilyard","submitted_at":"2017-01-09T15:10:18Z","abstract_excerpt":"For a tree $T$, let $i_T(t)$ be the number of independent sets of size $t$ in $T$. It is an open question, raised by Alavi, Malde, Schwenk and Erd\\H{o}s, whether the sequence $(i_T(t))_{t \\geq 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 $\\ell_1$ and $\\ell_2$ pendant edges dropped alternately fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02204","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}