Published November 22, 2026
| Version 1.4
Preprint
Open
Two questions of Jerrum and Patel on zeros of the independence polynomial
Authors/Creators
- 1. Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel
Description
Jerrum and Patel asked whether the claw-free graphs of bounded degree, or of bounded clique number, have an open multivariate zero-free region for the independence polynomial containing [0,∞). They also asked whether the graphs of maximum degree at most Δ with no induced subdivided claw S_{t,t,t} have a zero-free sector. For the first question the answer is positive. Jerrum and Patel consider the parabolic region R(K) = {z ∈ ℂ : (Im z)² < Re z/K + 1/(4K²)}; we show that R(K) with K = 2500(Δ+1) is multivariate zero-free for claw-free graphs of maximum degree at most Δ, and R(K) with K = 2500·r(3,k) for claw-free graphs of clique number at most k, where r(3,k) is a Ramsey number. Both parameters are optimal up to a constant factor. For the second question the answer is negative when t ≥ 2 and Δ ≥ 6: for every large m there is a graph of maximum degree 6 with no induced S_{1,2,2} and a zero z_m with |2^(−m)·z_m − e^(iπ/m)| < m^(−2).
Code: https://github.com/yspennstate/claw-free-independence-zeros
Files
claw-free-independence-zeros.pdf
Additional details
Related works
- Is part of
- https://github.com/yspennstate/math-brain-public (URL)
- Is supplemented by
- https://github.com/yspennstate/claw-free-independence-zeros/tree/4610e301adbcc768c0ee5cfad1ab85498dec1088 (URL)
- References
- https://github.com/yspennstate/brain-framework-public (URL)
- https://github.com/yspennstate/math-brain-public/tree/main/papers/math-brain-2026-10-24 (URL)
References
- M. Ajtai, J. Komlós and E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory Ser. A 29 (1980), 354–360. doi: 10.1016/0097-3165(80)90030-8.
- F. Bencs, Graphs, groups and measures, Ph.D. thesis, Central European University, 2019.
- M. Chudnovsky and P. Seymour, The roots of the independence polynomial of a clawfree graph, J. Combin. Theory Ser. B 97 (2007), 350–357. doi: 10.1016/j.jctb.2006.06.001.
- P. M. S. Fialho and A. Procacci, On the independent set polynomial of graphs and claw-free graphs, preprint, 2025, arXiv:2505.22766.
- O. J. Heilmann and E. H. Lieb, Theory of monomer-dimer systems, Comm. Math. Phys. 25 (1972), 190–232. doi: 10.1007/BF01877590.
- M. Jerrum and V. Patel, Zero-free regions for the independence polynomial on restricted graph classes, J. London Math. Soc. (2) 113 (2026), no. 2, e70458. doi: 10.1112/jlms.70458; arXiv:2510.01466v2.
- J. H. Kim, The Ramsey number R(3,t) has order of magnitude t²/log t, Random Structures Algorithms 7 (1995), 173–207. doi: 10.1002/rsa.3240070302.
- J. D. Leake and N. R. Ryder, Generalizations of the matching polynomial to the multivariate independence polynomial, Algebr. Comb. 2 (2019), no. 5, 781–802. https://www.numdam.org/item/ALCO_2019__2_5_781_0/.
- J. L. Lebowitz, D. Ruelle and E. R. Speer, Location of the Lee–Yang zeros and absence of phase transitions in some Ising spin systems, J. Math. Phys. 53 (2012), 095211. doi: 10.1063/1.4738622.
- W. Mantel, Problem 28, Wiskundige Opgaven 10 (1907), 60–61.
- H. Peters and G. Regts, On a conjecture of Sokal concerning roots of the independence polynomial, Michigan Math. J. 68 (2019), 33–55. doi: 10.1307/mmj/1541667626.
- J. B. Shearer, On a problem of Spencer, Combinatorica 5 (1985), no. 3, 241–245. doi: 10.1007/BF02579368.
- Y. Shmalo, Math Brain: public snapshot, code and tests, 2026. https://github.com/yspennstate/math-brain-public/tree/5427734deee9be643d6dfbdd5e7d4baeeefe4a4a.
- Y. Shmalo, Math Brain: shared, auditable memory for multi-agent mathematical research, October 2026. https://github.com/yspennstate/math-brain-public/tree/main/papers/math-brain-2026-10-24, doi: 10.5281/zenodo.24150837.
- Y. Shmalo, Brain Framework, public software repository, 2026. https://github.com/yspennstate/brain-framework-public/tree/46b935d26d5a2893f7790b60466387dd8da47ef5.