Weighted enumeration of spanning subgraphs with degree constraints

DOI10.1016/j.jctb.2008.07.007zbMath1184.05066arXiv0803.1659OpenAlexW2016843307MaRDI QIDQ1003837

David G. Wagner

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.1659

zbMATH Keywords

partition functionphase transitionmatching polynomialHeilmann-Lieb theoremlogarithmic concavityhalf-plane propertyHurwitz stabilityGrace-Szegő-Walsh theoremgraph factorLee-Yang theory

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Central limit theorems, Lee-Yang zeros, and graph-counting polynomials ⋮ Approximating real-rooted and stable polynomials, with combinatorial applications ⋮ The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability ⋮ Random cluster model on regular graphs ⋮ Using edge generating function to solve monomer-dimer problem ⋮ Some applications of Wagner's weighted subgraph counting polynomial ⋮ The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications ⋮ A new approach to the orientation of random hypergraphs ⋮ Weighted enumeration of spanning subgraphs in locally tree-like graphs ⋮ Spectrahedrality of hyperbolicity cones of multivariate matching polynomials

Cites Work

• Unnamed Item
• Counting unbranched subgraphs
• Zeros of graph-counting polynomials
• Log-Sobolev inequalities and sampling from log-concave distributions
• Homogeneous multivariate polynomials with the half-plane property
• Theory of monomer-dimer systems
• Multipartition Series
• A Generalization of a Theorem of Bôcher
• Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
• Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
• A normal law for matchings

This page was built for publication: Weighted enumeration of spanning subgraphs with degree constraints