Arborescences of Random Covering Graphs

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

• Luke Hawranick

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
• Exact Stability for Turan's Theoremarxiv.org
• [2604.04115] Gallai 3-colourings of random graphsarxiv.org
• Random Turán Problems for Graphs with a Vertex Complete to One Partarxiv.org
• Induced rational exponents near twoarxiv.org
• [2603.23431] On the number of families avoiding a subposetarxiv.org
• Sublinear expandersias.edu
• nullstellensatzweb.math.princeton.edu
• quasikernelarxiv.org
• [2305.02725] Two-round Ramsey games on random graphsarxiv.org
• Rainbow Turán Problemspeople.math.ethz.ch