Proves that among rectangular grids with n squared vertices the n by n square maximizes the number of spanning trees via Laplacian formula and hyperbolic coordinates.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs
Proves that among rectangular grids with n squared vertices the n by n square maximizes the number of spanning trees via Laplacian formula and hyperbolic coordinates.