Zero‐free regions for the independence polynomial on restricted graph classes

Abstract Generalising the Heilmann–Lieb theorem from statistical physics, Chudnovsky and Seymour [ J. Combin. Theory Ser. B , 97 (2007), no. 3, 350–357] showed that the univariate independence polynomial of any claw‐free graph has all of its zeros on the negative real line. In this paper, we show that for any fixed subdivided claw and any , there is an open set containing such that the independence polynomial of any ‐free graph of maximum degree has all of its zeros outside of . We also show that no such result can hold when is any graph other than a subdivided claw or if we drop the maximum degree condition. We also establish zero‐free regions for the multivariate independence polynomial of ‐free graphs of bounded degree when is a subdivided claw. The statements of these results are more subtle, but are again best possible in various senses.

Authors

Institutions

Publication Details

Journal
Journal of the London Mathematical Society
Published
2026-02-01
DOI
https://doi.org/10.1112/jlms.70458
Primary Topic
Random Matrices and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Zero‐free regions for the independence polynomial on restricted graph classes

Viresh Patel, Mark Jerrum
Journal of the London Mathematical Society
Random Matrices and Applications
article

Zero‐free regions for the independence polynomial on restricted graph classes

Viresh Patel, Mark Jerrum
article en

Abstract

Abstract Generalising the Heilmann–Lieb theorem from statistical physics, Chudnovsky and Seymour [ J. Combin. Theory Ser. B , 97 (2007), no. 3, 350–357] showed that the univariate independence polynomial of any claw‐free graph has all of its zeros on the negative real line. In this paper, we show that for any fixed subdivided claw and any , there is an open set containing such that the independence polynomial of any ‐free graph of maximum degree has all of its zeros outside of . We also show that no such result can hold when is any graph other than a subdivided claw or if we drop the maximum degree condition. We also establish zero‐free regions for the multivariate independence polynomial of ‐free graphs of bounded degree when is a subdivided claw. The statements of these results are more subtle, but are again best possible in various senses.

Journal of the London Mathematical SocietyVol. 113(2)
Queen Mary University of London (GB)
Openalex Percentile: Top 53%
Random Matrices and Applications
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.