On the minimum spanning tree distribution in grids

DOI10.1016/J.EJC.2025.104325MaRDI QIDQ6872450zbMATH OpenFDO

Authors Kristopher Tapp

Publication date 20 January 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104325

zbMATH Keywords

bipartite graphLyons-Peres formulaMST probability of a spanning tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• A Graph-Theoretic Game and Its Application to the k-Server Problem
• Benchmarks for Strictly Fundamental Cycle Bases
• Critical random graphs and the structure of a minimum spanning tree
• Lower bounds for strictly fundamental cycle bases in grid graphs
• Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
• Minimal spanning forests
• Probability on trees and networks
• Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans

This page was built for publication: On the minimum spanning tree distribution in grids

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