Weighted enumeration of spanning subgraphs with degree constraints

Authors:
David G. Wagner
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
Journal of Combinatorial Theory Series B
Year:
2009

Citing 2
Cited 1

Multipartition Series

SIAM Journal on Discrete Mathematics
Counting Unbranched Subgraphs

Journal of Algebraic Combinatorics: An International Journal

A new approach to the orientation of random hypergraphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Heilmann-Lieb Theorem on (univariate) matching polynomials states that the polynomial @?"km"k(G)y^k has only real nonpositive zeros, in which m"k(G) is the number of k-edge matchings of a graph G. There is a stronger multivariate version of this theorem. We provide a general method by which ''theorems of Heilmann-Lieb type'' can be proved for a wide variety of polynomials attached to the graph G. These polynomials are multivariate generating functions for spanning subgraphs of G with certain weights and constraints imposed, and the theorems specify regions in which these polynomials are nonvanishing. Such theorems have consequences for the absence of phase transitions in certain probabilistic models for spanning subgraphs of G.