26 citations · 106 across the 27 of their papers we have counts for
1 paper · 2 filters
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…