Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The isoperimetric number of random regular graphs
European Journal of Combinatorics
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the second eigenvalue of a graph
Discrete Mathematics
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Bounds on the bisection width for random d -regular graphs
Theoretical Computer Science
The isoperimetric constant of the random graph process
Random Structures & Algorithms
Long-range percolation mixing time
Combinatorics, Probability and Computing
Congestion and almost invariant sets in dynamical systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
On the complexity of Newman's community finding approach for biological and social networks
Journal of Computer and System Sciences
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.00 |
It is shown that if nn0(d) then any d-regular graph G=(V, E) on n vertices contains a set of u=⌊n/2⌋ vertices which is joined by at most (d/2−c√d)u edges to the rest of the graph, where c0 is some absolute constant. This is tight, up to the value of c.