172 citations · 377 across the 33 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
math.CO2006★ 6 cited
Topology of random clique complexes
Matthew Kahle
In a seminal paper, Erdos and Renyi identified the threshold for connectivity of the random graph G(n,p). In particular, they showed that if p >> log(n)/n then G(n,p) is almost alw…
math.CO2006★ 2 cited
The neighborhood complex of a random graph
Matthew Kahle
For a graph G, the neighborhood complex N[G] is the simplicial complex having all subsets of vertices with a common neighbor as its faces. It is a well known result of Lovasz that…