ELibM Journals • ELibM Home • EMIS Home • EMIS Mirrors

  EMIS Electronic Library of Mathematics (ELibM)
The Open Access Repository of Mathematics
  EMIS ELibM Electronic Journals

JOURNAL OF
ALGEBRAIC
COMBINATORICS

  Editors-in-chief: C. A. Athanasiadis, T. Lam, A. Munemasa, H. Van Maldeghem
ISSN 0925-9899 (print) • ISSN 1572-9192 (electronic)
 

Counting Unbranched Subgraphs

David Ruelle
IHES 91440 Bures sur Yvette France

DOI: 10.1023/A:1018690328814

Abstract

Given an arbitrary finite graph, the polynomial Q( z) = S F Ĩ U Z cardF Q(z) = ΣF \in U^{_{^{Z^{cardF} } } } associates a weight zcardF to each unbranched subgraph F of length cardF. We show that all the zeros of Q have negative real part.

Pages: 157–160

Keywords: counting polynomial; graph; unbranched subgraph

Full Text: PDF

References

1. T. Asano, “Theorems on the partition functions of the Heisenberg ferromagnets,” J. Phys. Soc. Jap. 29 (1970), 350-359.
2. O.J. Heilmann and E.H. Lieb, “Theory of monomer-dimer systems,” Commun. Math. Phys. 25 (1972),190- 232; 27 (1972), 166.
3. T.D. Lee and C.N. Yang, “Statistical theory of equations of state and phase relations. II. Lattice gas and Ising model,” Phys. Rev. 87 (1952), 410-419.
4. G. Polya and G. Szeg\ddot o, Aufgaben und Lehrs\ddot atze aus der Analysis, Vol. 2, 3rd edition, Springer, Berlin, 1964.
5. D. Ruelle, “Extension of the Lee-Yang circle theorem,” Phys. Rev. Letters 26 (1971), 303-304.
6. D.J. Wagner, “Multipartition series,” S.I.A.M. J. Discrete Math. 9 (1996), 529-544.




© 1992–2009 Journal of Algebraic Combinatorics
© 2012 FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition