On the Random Minimum Spanning Subgraph Problem for Hypergraphs
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910464415367168 |
|---|---|
| author | Zvonkov, Nikita |
| author_facet | Zvonkov, Nikita |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_20016 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Random Minimum Spanning Subgraph Problem for Hypergraphs Zvonkov, Nikita Combinatorics 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. |
| title | On the Random Minimum Spanning Subgraph Problem for Hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2405.20016 |