Arborescences of Random Covering Graphs
Combinatorics
2025-06-06 v4
Abstract
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.
Keywords
Cite
@article{arxiv.2412.12633,
title = {Arborescences of Random Covering Graphs},
author = {Muchen Ju and Junjie Ni and Kaixin Wang and Yihan Xiao},
journal= {arXiv preprint arXiv:2412.12633},
year = {2025}
}
Comments
10 pages,4 figures