Arborescences of Random Covering Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908393902440448 |
|---|---|
| author | Ju, Muchen Ni, Junjie Wang, Kaixin Xiao, Yihan |
| author_facet | Ju, Muchen Ni, Junjie Wang, Kaixin Xiao, Yihan |
| contents | A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. showed that the arborescences of a covering graph of a directed graph G are closely related to the arborescences of G. In this paper, we study the weighted sum of arborescences of a random covering graph and give a formula for the expected value, resolving a conjecture of Chepuri et al. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_12633 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Arborescences of Random Covering Graphs Ju, Muchen Ni, Junjie Wang, Kaixin Xiao, Yihan Combinatorics A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. showed that the arborescences of a covering graph of a directed graph G are closely related to the arborescences of G. In this paper, we study the weighted sum of arborescences of a random covering graph and give a formula for the expected value, resolving a conjecture of Chepuri et al. |
| title | Arborescences of Random Covering Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.12633 |