1 citations · 1 across the 1 of their papers we have counts for
1 paper
Lars Engebretsen
A graph with vertex set V and edge set E is called a (d,c)-expander if the maximum degree of a vertex is d and, for every subset W of V that has cardinality at most |V|/2, the numb…