87 citations · 193 across the 17 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
Simplicial spanning trees in random Steiner complexes
Ron Rosenthal, Lior Tenenbaum
A spanning tree in a graph is a sub-graph of with the same vertex set as which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spannin…
math.PR2020
On the Spectrum of Dense Random Geometric Graphs
Kartick Adhikari, Robert J. Adler, Omer Bobrowski +1
In this paper we study the spectrum of the random geometric graph , in a regime where the graph is dense and highly connected. In the \erdren random graph it is we…