Weighted enumeration of spanning subgraphs with degree constraints (Q1003837)

The Heilmann-Lieb Theorem on (univariate) matching polynomials [\textit{O. J. Heilmann} and \textit{E. J. Lieb}, Commun. Math. Phys. 25, 190--232 (1972; Zbl 0228.05131)] states that the polynomial \(\sum_k m_k(G)y^k\) has only real non-positive zeros, in which \(m_k(G)\) is the number of \(k\)-edge matchings of a graph \(G\). The same article contains a stronger multivariate version of this theorem. The author provides a general method by which ``theorems of Heilmann-Lieb type'' can be proved for a wide variety of polynomials attached to the graph \(G\). These polynomials are multivariate generating functions for spanning subgraphs of \(G\) with certain weights and constraints imposed, and the theorems specify regions in which these polynomials are non-vanishing. Such theorems have consequences for the absence of phase transitions in certain probabilistic models for spanning subgraphs of \(G\). Reviewer's remark: No reference is given for the Grace-Szegő-Walsh theorem. The reviewer is not the third author of this theorem.