Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-23T14:02:06.013Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Edge-Expansion of Graphs

Published online by Cambridge University Press:  01 June 1997

NOGA ALON
NOGA ALON
Affiliation:
Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

It is shown that if n>n0(d) then any d-regular graph G=(V, E) on n vertices contains a set of u=[lfloor ]n/2[rfloor ] 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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 2 , June 1997 , pp. 145 - 152
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)