Contractible independence complexes of trees

We show that the independence complex of a tree is contractible if and only if it can be reduced to a path P n with n ≡ 1 ( mod 3 ) by a sequence of truncation moves at branching points. As a consequence of our method, we also characterize the trees for which the independence polynomial evaluated at −1 is equal to 1 or −1.

Authors

Institutions

Publication Details

Journal
Discrete Applied Mathematics
Published
2026-10-15
DOI
https://doi.org/10.1016/j.dam.2026.10.013
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Contractible independence complexes of trees

My Hanh Pham, Thanh Vu
Discrete Applied Mathematics
Advanced Combinatorial Mathematics
article

Contractible independence complexes of trees

My Hanh Pham, Thanh Vu
article en

Abstract

We show that the independence complex of a tree is contractible if and only if it can be reduced to a path P n with n ≡ 1 ( mod 3 ) by a sequence of truncation moves at branching points. As a consequence of our method, we also characterize the trees for which the independence polynomial evaluated at −1 is equal to 1 or −1.

Discrete Applied MathematicsVol. 398
Vietnam National University Ho Chi Minh City (VN), Institute of Mathematics (VN), An Giang University (VN), Vietnam Academy of Science and Technology (VN)
Openalex Percentile: Top 53%
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.