9 citations · 16 across the 21 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.PR2014
On the phase transition in random simplicial complexes
Nathan Linial, Yuval Peled
It is well-known that the model of random graphs undergoes a dramatic change around . It is here that the random graph is, almost surely, no longer a forest, a…
math.CO2014★ 9 cited
Extremal problems on shadows and hypercuts in simplicial complexes
Nati Linial, Ilan Newman, Yuval Peled +1
Let be an -vertex forest. We say that an edge is in the shadow of if contains a cycle. It is easy to see that if is "almost a tree", that is…