Zeros of graph-counting polynomials
From MaRDI portal
Publication:1284085
DOI10.1007/s002200050522zbMath0917.05074MaRDI QIDQ1284085
Publication date: 11 August 1999
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002200050522
05C99: Graph theory
Related Items
Approximating real-rooted and stable polynomials, with combinatorial applications, About David Ruelle, after his 80th birthday, The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability, Weighted enumeration of spanning subgraphs with degree constraints, Graph-counting polynomials for oriented graphs, The planar limit of \(\mathcal{N} = 2\) superconformal quiver theories, Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems, The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications