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

DOI10.1142/S0217979221500855zbMATH Open1462.05059arXiv2012.13468WikidataQ115523911 ScholiaQ115523911MaRDI QIDQ4994871FDOQ4994871

Authors: Robert Shrock, Shu-Chiuan Chang 

Publication date: 22 June 2021

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

Abstract: We compare our upper bounds on the exponential growth constant $phi(Lambda)$ characterizing the asymptotic behavior of spanning forests on Archimedean lattices $Lambda$ with recently derived upper bounds. Our upper bounds on $phi(Lambda)$, which are very close to the respective values of $phi(Lambda)$ that we have calculated, are shown to be significantly better for these lattices than the new upper bounds.

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

Recommendations

• Asymptotic behavior of spanning forests and connected spanning subgraphs on two-dimensional lattices
• Study of exponential growth constants of directed heteropolygonal Archimedean lattices
• Some exact results for spanning trees on lattices
• Spanning trees on lattices and integral identities
• Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices

zbMATH Keywords

classical statistical mechanicsgeneral statistical methodscombinatorics and graph theory

Mathematics Subject Classification ID

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

Cites Work

• On dichromatic polynomials
• On the computational complexity of the Jones and Tutte polynomials
• 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
• Title not available (Why is that?)
• Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph
• Study of exponential growth constants of directed heteropolygonal Archimedean lattices

Cited In (4)

• Asymptotic behavior of spanning forests and connected spanning subgraphs on two-dimensional lattices
• Upper bound for the number of spanning forests of regular graphs
• On the number of forests and connected spanning subgraphs
• Study of exponential growth constants of directed heteropolygonal Archimedean lattices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994871)