Arborescences of Random Covering Graphs
arxiv.org · 4,359 words · saved by 1 readers
N/A
ARBORESCENCES OF RANDOM COVERING GRAPHS MUCHEN JU, JUNJIE NI, KAIXIN WANG, AND YIHAN XIAO Abstract. A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. [1] showed that the arborescences of a covering graph of a directed graph G are closely related to the arborescences of G. In this arXiv:2412.12633v4…
saved by
related reading
- refining bounds - cover timesarxiv.org
- [2604.27639] How large part of a graph can be covered by the neighborhoods of k vertices?arxiv.org
- nullstellensatzweb.math.princeton.edu
- generalized symmetric distance matrix detarxiv.org
- [2604.04115] Gallai 3-colourings of random graphsarxiv.org
- Cover times - spectralarxiv.org
- piercing intervals - gyarfasarxiv.org
- 02_GyarfasLehel_AHellyTypeProblemInTrees.pdfusers.renyi.hu
- random subgraphs rainbowarxiv.org
- parity edge coloringmilans.us
- rainbow-turan-full-version.pdfpeople.maths.ox.ac.uk
- rainbow treesarxiv.org