Search arXivSearch

arXiv · 2505.22766

On the independent set polynomial of graphs and claw-free graphs

Abstract

We present two new contributions to the study of the independence polynomial $Z_G(z)$ of a finite simple graph $G = (V,E)$. First, we provide an improved lower bound for the zero-free region of $Z_G(z)$ for the important class of claw-free graphs. Our bound exceeds the classical Shearer radius and it is derived through a refined application of the Fernández-Procacci criterion using properties of the local neighborhood structure in claw-free graphs. Second, we establish a novel combinatorial expression for $Z_G(z)$, inspired by the connection with the abstract polymer gas models in statistical mechanics, which offers a new structural interpretation of the polynomial and may be of independent interest. These results strengthen the connection between statistical physics, combinatorics, and graph theory, and suggest new approaches for analytic exploration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paula M. S. Fialho, Aldo Procacci. 2025-08-13. On the independent set polynomial of graphs and claw-free graphs. https://arxiv.org/abs/2505.22766

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO