Trees of diameter four with non-log-concave independence polynomials

The independence polynomial of a tree need not be log-concave: the first examples, found by Kadrawi, Levit, Yosef and Mizrachi, have 26 vertices, and several infinite families are now known. We show that log-concavity can fail already for trees of diameter four. Let Td be the tree obtained from the star K1,d by attaching two pendant vertices to each of its leaves. We prove that the independence polynomial of Td is log-concave if and only if d ≤ 16391, and that the number of indices at which log-concavity fails tends to infinity with d. Since the independence polynomial of every tree of diameter at most three is log-concave, four is the smallest diameter of a tree whose independence polynomial is not log-concave. The independence polynomials of the trees Td are unimodal. The programs and their output for all computations are in supplementary.zip (see programs/README.txt there), together with the LaTeX source.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24407091
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Trees of diameter four with non-log-concave independence polynomials

Vadim Genkin
4 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Trees of diameter four with non-log-concave independence polynomials

Vadim Genkin
preprint en

Abstract

The independence polynomial of a tree need not be log-concave: the first examples, found by Kadrawi, Levit, Yosef and Mizrachi, have 26 vertices, and several infinite families are now known. We show that log-concavity can fail already for trees of diameter four. Let Td be the tree obtained from the star K1,d by attaching two pendant vertices to each of its leaves. We prove that the independence polynomial of Td is log-concave if and only if d ≤ 16391, and that the number of indices at which log-concavity fails tends to infinity with d. Since the independence polynomial of every tree of diameter at most three is log-concave, four is the smallest diameter of a tree whose independence polynomial is not log-concave. The independence polynomials of the trees Td are unimodal. The programs and their output for all computations are in supplementary.zip (see programs/README.txt there), together with the LaTeX source.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon