81 citations · 383 across the 34 of their papers we have counts for
1 paper · 2 filters
Doron Puder
We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to bot…