On the Difference of Expected Lengths of Minimum Spanning Trees

DOI10.1017/S0963548308009590zbMath1198.05026OpenAlexW2139482880MaRDI QIDQ3557498

Wenbo V. Li, Xinyi Zhang

Publication date: 23 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548308009590

zbMATH Keywords

Tutte polynomialwheelslength of minimum spanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31)

Related Items (3)

On the Length of a Random Minimum Spanning Tree ⋮ A randomly weighted minimum spanning tree with a random cost constraint ⋮ Typical values of extremal-weight combinatorial structures with independent symmetric weights

Cites Work

• On random minimum length spanning trees
• On the value of a random minimum spanning tree problem
• On Frieze's \(\zeta\) (3) limit for lengths of minimal spanning trees
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Random minimum length spanning trees in regular graphs
• The Expected Length of a Minimal Spanning Tree of a Cylinder Graph
• Multicyclic components in a random graph process
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• A Class of Self-Dual Maps
• Squaring the Square

This page was built for publication: On the Difference of Expected Lengths of Minimum Spanning Trees