On the Random Minimum Spanning Subgraph Problem for Hypergraphs
Nikita Zvonkov · arXiv (Cornell University) · 2024
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 weight of the minimum spanning tree tends to a constant, which can be calculated depending on the distribution. In this paper, we generalise this result to the hypergraphs setting.