8 citations · 11 across the 15 of their papers we have counts for
6 papers · 1 filter
Rigid partitions: from high connectivity to random graphs
Michael Krivelevich, Alan Lew, Peleg Michaeli
A graph is called -rigid if there exists a generic embedding of its vertex set into such that every continuous motion of the vertices that preserves the lengths o…
Asymptotic behavior of Laplacian eigenvalues of subspace inclusion graphs
Alan Lew
Let be the simplicial complex whose vertices are the non-trivial subspaces of and whose simplices correspond to families of subspaces forming a f…
Laplacian eigenvalues of independence complexes via additive compound matrices
Alan Lew
The independence complex of a graph is the simplicial complex on vertex set whose simplices are the independent sets in . We present new lower bounds on the…
Extensions of the Colorful Helly Theorem for -collapsible and -Leray complexes
Minki Kim, Alan Lew
We present extensions of the Colorful Helly Theorem for -collapsible and -Leray complexes, providing a common generalization to the matroidal versions of the theorem due to K…
Garland's method for token graphs
Alan Lew
The -th token graph of a graph is the graph whose vertices are the -subsets of and whose edges are all pairs of -subsets such that the symmetr…
Rigidity expander graphs
Alan Lew, Eran Nevo, Yuval Peled +1
Jordán and Tanigawa recently introduced the -dimensional algebraic connectivity of a graph . This is a quantitative measure of the -dimensional rigidity of wh…