Spanning tree bounds for grid graphs

DOI10.37236/12130arXiv2109.05987WikidataQ129296898 ScholiaQ129296898MaRDI QIDQ6197797

Kristopher Tapp

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

grid graphsbulk limitcompactness of district maps

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) History, political science (91F10) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• On the number of spanning trees on various lattices
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Identities and Inequalities for Tree Entropy
• Sharp upper bounds for the number of spanning trees of a graph
• Spanning trees on graphs and lattices inddimensions
• The number of spanning trees in graphs with a given degree sequence
• Asymptotic Enumeration of Spanning Trees
• The asymptotic determinant of the discrete Laplacian

This page was built for publication: Spanning tree bounds for grid graphs