Pages that link to "Item:Q1284085"
From MaRDI portal
The following pages link to Zeros of graph-counting polynomials (Q1284085):
Displaying 17 items.
- About David Ruelle, after his 80th birthday (Q526574) (← links)
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability (Q834799) (← links)
- Graph compression and the zeros of polynomials (Q834888) (← links)
- Weighted enumeration of spanning subgraphs with degree constraints (Q1003837) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Counting unbranched subgraphs (Q1283455) (← links)
- Graph-counting polynomials for oriented graphs (Q1631480) (← links)
- Polynomials counting nowhere-zero chains in graphs (Q2073314) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
- The planar limit of \(\mathcal{N} = 2\) superconformal quiver theories (Q2225807) (← links)
- Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
- Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems (Q2872266) (← links)
- The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications (Q3644871) (← links)
- (Q3699728) (← links)
- Counting faces of graphical zonotopes (Q4597494) (← links)
- Approximating real-rooted and stable polynomials, with combinatorial applications (Q5216314) (← links)