8 citations · 11 across the 15 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Rigidity of expanders and pseudorandom graphs
Michael Krivelevich, Alan Lew, Peleg Michaeli
A graph is called -rigid if, for a generic embedding of its vertices in , the only continuous motions of the vertices preserving the distances between al…
math.CO2026
Combinatorial sufficient conditions for graph rigidity and applications to random graphs
Michael Krivelevich, Alan Lew, Peleg Michaeli
A graph is called -rigid if, for a generic embedding of its vertices in , every edge-length preserving continuous motion of the vertices preserves the di…