On the public citation graph

Random Minimum Length Spanning Trees in Regular Graphs

https://doi.org/10.1007/pl00009825
0 signed · 62 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1098-2418(199801)12:1<63::aid-rsa4>3.0.co;2-ropenalex-snapshot
Random minimal spanning tree and percolation on theN-cube
inferredcites →https://doi.org/10.1002/rsa.3240070406openalex-snapshot
The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
inferredcites →https://doi.org/10.1007/bf01275671openalex-snapshot
Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)
inferredcites →https://doi.org/10.1007/bf02125348openalex-snapshot
On random minimum length spanning trees
inferredcites →https://doi.org/10.1007/bf02699376openalex-snapshot
Concentration of measure and isoperimetric inequalities in product spaces
inferredcites →https://doi.org/10.1016/0166-218x(85)90058-7openalex-snapshot
On the value of a random minimum spanning tree problem
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/s0195-6698(13)80135-7openalex-snapshot
Exact Face-isoperimetric Inequalities
inferredcites →https://doi.org/10.1137/1.9781611970029openalex-snapshot
Probability Theory and Combinatorial Optimization
inferredcites →https://doi.org/10.1201/b12336-12openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.1214/aoap/1177005773openalex-snapshot
The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model: A Unified Approach
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4273484openalex-extracted
Heavy and Light Paths and Hamilton Cycles
inferred← citeshttps://doi.org/10.1002/rsa.10100openalex-snapshot
The emergence of a giant component in random subgraphs of pseudo‐random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20402openalex-snapshot
Component structure of the vacant set induced by a random walk on a random graph
inferred← citeshttps://doi.org/10.1002/rsa.20774openalex-snapshot
Optimization on sparse random hypergraphs and spin glasses
inferred← citeshttps://doi.org/10.1002/rsa.20903openalex-snapshot
Asymptotics in percolation on high‐girth expanders
inferred← citeshttps://doi.org/10.1002/rsa.20962openalex-snapshot
Successive shortest paths in complete graphs with random edge weights
inferred← citeshttps://doi.org/10.1002/rsa.21078openalex-snapshot
The largest hole in sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.21141openalex-snapshot
Site percolation on pseudo‐random graphs
inferred← citeshttps://doi.org/10.1002/rsa.21225openalex-snapshot
Expansion in supercritical random subgraphs of expanders and its consequences
inferred← citeshttps://doi.org/10.1002/rsa.21268openalex-snapshot
Percolation on High‐Dimensional Product Graphs
inferred← citeshttps://doi.org/10.1002/rsa.21278openalex-snapshot
Coloring Graphs From Random Lists
inferred← citeshttps://doi.org/10.1002/rsa.70053openalex-snapshot
Random Minimum Spanning Tree and Dense Graph Limits
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_8openalex-snapshot
The Largest Hole in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_14openalex-snapshot
Minimal Spanning Trees for Graphs with Random Edge Lengths
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_10openalex-snapshot
Pseudo-random Graphs
inferred← citeshttps://doi.org/10.1007/bf02679617openalex-snapshot
Near-optimal bounded-degree spanning trees
inferred← citeshttps://doi.org/10.1007/s00440-003-0308-9openalex-snapshot
A proof of Parisi’s conjecture on the random assignment problem
inferred← citeshttps://doi.org/10.1007/s00440-021-01071-3openalex-snapshot
Geometry of the minimal spanning tree of a random 3-regular graph
inferred← citeshttps://doi.org/10.1007/s00440-024-01259-3openalex-snapshot
Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
inferred← citeshttps://doi.org/10.1007/s00493-004-0013-zopenalex-snapshot
On the Value of a Random Minimum Weight Steiner Tree
inferred← citeshttps://doi.org/10.1007/s00493-024-00089-0openalex-snapshot
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs
inferred← citeshttps://doi.org/10.1007/s10955-023-03188-2openalex-snapshot
Multidimensional Lambert–Euler inversion and Vector-Multiplicative Coalescent Processes
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100857openalex-snapshot
Random spanning trees and forests: a geometric focus
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114453openalex-snapshot
Minimum degree k and k-connectedness usually arrive together
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106396openalex-snapshot
Heavy and light paths and Hamilton cycles
inferred← citeshttps://doi.org/10.1016/j.orl.2022.01.009openalex-snapshot
A concentration inequality for the facility location problem
inferred← citeshttps://doi.org/10.1017/s0963548302005114openalex-snapshot
Exact Expectations and Distributions for the Random Assignment Problem
inferred← citeshttps://doi.org/10.1017/s0963548306007668openalex-snapshot
The Expected Length of a Minimal Spanning Tree of a Cylinder Graph
inferred← citeshttps://doi.org/10.1017/s096354830600770xopenalex-snapshot
On an Online Spanning Tree Problem in Randomly Weighted Graphs
inferred← citeshttps://doi.org/10.1017/s0963548308009590openalex-snapshot
On the Difference of Expected Lengths of Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1017/s0963548315000024openalex-snapshot
On the Length of a Random Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1017/s0963548317000426openalex-snapshot
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
inferred← citeshttps://doi.org/10.1017/s0963548322000323openalex-snapshot
Supercritical site percolation on the hypercube: small components are small
inferred← citeshttps://doi.org/10.1017/s0963548325000069openalex-snapshot
Colouring random subgraphs
inferred← citeshttps://doi.org/10.1137/1.9781611973082.92openalex-snapshot
Component structure of the vacant set induced by a random walk on a random graph.
inferred← citeshttps://doi.org/10.1137/14097937xopenalex-snapshot
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk
inferred← citeshttps://doi.org/10.1137/15m1047672openalex-snapshot
Minimum Cost Matching in a Random Graph with Random Costs
inferred← citeshttps://doi.org/10.1137/20m1335418openalex-snapshot
The Effect of Adding Randomly Weighted Edges
inferred← citeshttps://doi.org/10.1184/r1/6478415openalex-snapshot
Minimum-cost matching in a random bipartite graph with random costs
inferred← citeshttps://doi.org/10.1184/r1/6478898.v1openalex-snapshot
On the length of a random minimum spanning tree
inferred← citeshttps://doi.org/10.1214/16-aop1132openalex-snapshot
The scaling limit of the minimum spanning tree of the complete graph
inferred← citeshttps://doi.org/10.1214/22-aop1592openalex-snapshot
Expansion in supercritical random subgraphs of the hypercube and its consequences
inferred← citeshttps://doi.org/10.1214/ejp.v15-735openalex-snapshot
Expected Lengths of Minimum Spanning Trees for Non-identical Edge Distributions
inferred← citeshttps://doi.org/10.30757/alea.v18-05openalex-snapshot
Cross-multiplicative coalescent processes and applications
inferred← citeshttps://doi.org/10.37236/1519openalex-snapshot
A Note on Random Minimum Length Spanning Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1667openalex-snapshot
The local weak limit of the minimum spanning tree of the complete graph
inferred← citeshttps://doi.org/10.48550/arxiv.math/0307357openalex-snapshot
A proof of a conjecture of Buck, Chan and Robbins on the random assignment problem
inferred← citeshttps://doi.org/10.5555/1070432.1070562openalex-snapshot
On the random 2-stage minimum spanning tree
inferred← citeshttps://doi.org/10.5555/2133036.2133128openalex-snapshot
Component structure of the vacant set induced by a random walk on a random graph
inferred← citeshttps://doi.org/10.7151/dmgt.1662openalex-snapshot
Exact expectation and variance of minimal basic of random matroids
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.