On the Random Minimum Spanning Subgraph Problem for Hypergraphs
Combinatorics
2024-05-31 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2405.20016,
title = {On the Random Minimum Spanning Subgraph Problem for Hypergraphs},
author = {Nikita Zvonkov},
journal= {arXiv preprint arXiv:2405.20016},
year = {2024}
}