Hypergraph independence polynomials with a zero close to the origin

DOI10.1017/S0963548324000464MaRDI QIDQ6879474zbMATH OpenFDO

Authors Shengtong Zhang

Publication date 30 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548324000464

zbMATH Keywords

hypergraphindependence polynomialzero-free region

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)

Cites work

• Approximate counting and sampling via local central limit theorems
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
• Computational transition at the uniqueness threshold
• Counting independent sets up to the tree threshold
• On a conjecture of Sokal concerning roots of the independence polynomial
• On a problem of Spencer
• On the probability of nonexistence in binomial subsets
• On the zeroes of hypergraph independence polynomials
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Theory of monomer-dimer systems

This page was built for publication: Hypergraph independence polynomials with a zero close to the origin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879474)