2 papers
math.CO2025
On the random minimum edge-disjoint spanning trees problem
Dmitry Shabanov, Nikita Zvonkov
It is well known that finding extremal values and structures can be hard in weighted graphs. However, if the weights are random, this problem can become way easier. In this paper,…
math.CO2024
On the Random Minimum Spanning Subgraph Problem for Hypergraphs
Nikita Zvonkov
The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the w…