Séminaire Lotharingien de Combinatoire, 93B.45 (2025), 11 pp.
Muchen Ju, Junjie Ni, Kaixin Wang and Yihan Xiao
Arborescences of Random Covering Graphs
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.
Received: November 15, 2024.
Accepted: February 15, 2025.
Final version: April 1, 2025.
The following versions are available: