Counting unbranched subgraphs

DOI10.1023/A:1018690328814zbMath0915.05068MaRDI QIDQ1283455

David Pierre Ruelle

Publication date: 23 June 1999

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

counting polynomialunbranched subgraph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (9)

Central limit theorems, Lee-Yang zeros, and graph-counting polynomials ⋮ Approximating real-rooted and stable polynomials, with combinatorial applications ⋮ Graph-counting polynomials for oriented graphs ⋮ Zero-freeness and approximation of real Boolean Holant problems ⋮ About David Ruelle, after his 80th birthday ⋮ Weighted enumeration of spanning subgraphs with degree constraints ⋮ The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications ⋮ Weighted enumeration of spanning subgraphs in locally tree-like graphs ⋮ Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems

Cites Work

• Theory of monomer-dimer systems
• Theorems on the Partition Functions of the Heisenberg Ferromagnets
• Multipartition Series
• Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model

This page was built for publication: Counting unbranched subgraphs