TY - JOUR
T1 - On the Edge-Expansion of Graphs
AU - Alon, Noga
PY - 1997
Y1 - 1997
N2 - It is shown that if n > n0(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.
AB - It is shown that if n > n0(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.
UR - http://www.scopus.com/inward/record.url?scp=0031521039&partnerID=8YFLogxK
U2 - 10.1017/S096354839700299X
DO - 10.1017/S096354839700299X
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0031521039
SN - 0963-5483
VL - 6
SP - 145
EP - 152
JO - Combinatorics Probability and Computing
JF - Combinatorics Probability and Computing
IS - 2
ER -