194 citations · 2.2k across the 69 of their papers we have counts for
1 paper · 1 filter
Jan Hladký, Asaf Nachmias, Tuan Tran
Let G be a connected graph in which almost all vertices have linear degrees and let T be a uniform spanning tree of G. For any fixed rooted tree F of height r we compute…