Counting unbranched subgraphs

DOI10.1023/A:1018690328814MaRDI QIDQ1283455zbMATH OpenFDO

Authors David 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)

Recommendations

• Graph-counting polynomials for oriented graphs
• Zeros of graph-counting polynomials
• On the roots of the subtree polynomial
• Almost unimodal and real-rooted graph polynomials

Cites work

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

Cited in

(11)

• Counting unlabeled structures
• Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
• Graph-counting polynomials for oriented graphs
• Weighted enumeration of spanning subgraphs with degree constraints
• Zero-freeness and approximation of real Boolean Holant problems
• 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
• Approximating real-rooted and stable polynomials, with combinatorial applications
• The complexity of ferromagnetic 2-spin systems on bounded degree graphs
• The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
• About David Ruelle, after his 80th birthday

This page was built for publication: Counting unbranched subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283455)