On the number of trees in Zd

DOI10.1088/0305-4470/25/12/014zbMath0756.05008OpenAlexW2094124635MaRDI QIDQ4022399

E. J. Janse van Rensburg

Publication date: 17 January 1993

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0305-4470/25/12/014

zbMATH Keywords

treeshypercubic latticesupermultiplicative inequality

Mathematics Subject Classification ID

Trees (05C05) Combinatorial inequalities (05A20) Planar graphs; geometric and topological aspects of graph theory (05C10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (5)

Long proteins with unique optimal foldings in the H-P model ⋮ A polyominoes-permutations injection and tree-like convex polyominoes ⋮ Lattice Polygons and Related Objects ⋮ Polygons and the Lace Expansion ⋮ A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.

This page was built for publication: On the number of trees in Z^d