On the edge-expansion of graphs

@inproceedings{ALO2002OnTE,
  title={On the edge-expansion of graphs},
  author={N ALO},
  year={2002}
}
  • A L O N
  • Published 2002
Received It is shown that if n > n 0 (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 c > 0 is some absolute constant. This is tight, up to the value of c. 

From This Paper

Topics from this paper.
34 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

On the second eigenvalue of a graph

  • A. Nilli
  • Discrete Mathematics
  • 1991

Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators

  • G. A. Margulis
  • Problemy Peredachi Informatsii
  • 1988
2 Excerpts

Similar Papers

Loading similar papers…