Zero-freeness of a multivariate monomer-dimer-cycle polynomial on bounded-degree graphs
Abstract
We initiate the study of a multivariate graph polynomial G(x,y,z) that interpolates between classical counting polynomials for matchings and for cycle structures arising in the Harary--Sachs expansion of the characteristic polynomial. We focus on analytic properties and computational consequences. Our main contribution is an explicit, degree-uniform zero-free region for G on bounded-degree graphs, obtained via the Fern\'andez--Procacci convergence criterion for abstract polymer gases.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.