Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds

DOI10.1142/S0217979221500855zbMath1462.05059arXiv2012.13468WikidataQ115523911 ScholiaQ115523911MaRDI QIDQ4994871

Robert Shrock, Shu-Chiuan Chang

Publication date: 22 June 2021

Published in: International Journal of Modern Physics B (Search for Journal in Brave)

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

zbMATH Keywords

classical statistical mechanicsgeneral statistical methodscombinatorics and graph theory

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (2)

Upper bound for the number of spanning forests of regular graphs ⋮ On the number of forests and connected spanning subgraphs

Cites Work

• On some Tutte polynomial sequences in the square lattice
• Forests, colorings and acyclic orientations of the square lattice
• Tutte polynomials and related asymptotic limiting functions for recursive families of graphs
• Study of exponential growth constants of directed heteropolygonal Archimedean lattices
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• On the computational complexity of the Jones and Tutte polynomials
• On dichromatic polynomials
• Unnamed Item

This page was built for publication: Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds