On the random minimum edge-disjoint spanning trees problem
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916610500984832 |
|---|---|
| author | Shabanov, Dmitry Zvonkov, Nikita |
| author_facet | Shabanov, Dmitry Zvonkov, Nikita |
| contents | 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, we examine the minimal weight of a union of $k$ edge-disjoint trees in a complete graph with independent and identically distributed edge weights. The limit of this value (for a given distribution) is known for $k=1,2$. We extend these results and find the limit value for any $k>2$. We also prove a related result regarding the structure of sparse random graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_08462 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the random minimum edge-disjoint spanning trees problem Shabanov, Dmitry Zvonkov, Nikita Combinatorics 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, we examine the minimal weight of a union of $k$ edge-disjoint trees in a complete graph with independent and identically distributed edge weights. The limit of this value (for a given distribution) is known for $k=1,2$. We extend these results and find the limit value for any $k>2$. We also prove a related result regarding the structure of sparse random graphs. |
| title | On the random minimum edge-disjoint spanning trees problem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2502.08462 |