A spectral Turan theorem

Fan Chung

Abstract
If all nonzero eigenvalues of the (normalized) Laplacian of a graph G are close to 1, then G is t-Tur an
in the sense that any subgraph of G containing no Kt+1 contains at most (1 1/t + o(1))e(G) edges
where e(G) denotes the number of edges in G.
1 Introduction
One of the classical theorems in graph theory is Tur ans Theorem which states that a graph on n vertices
containing no K
t+1
can have at most (1 1/t + o(1))
_
n
2
_
edges. Sudakov, Szab o and Vu [6] consider a
generalization of Turans Theorem. A graph G is said to be t-Tur an if any subgraph of G containing no
K
t+1
has at most (11/t +o(1))e(G) edges where e(G) denotes the number of edges in G. In [6], it is shown
that a regular graph on n vertices with degree d is t-Tur an if the second largest eigenvalue of its adjacency
matrix is suciently small.
In this paper, we consider Tur an numbers for general graphs as introduced in [6]. For two given graphs
G and H, the Tur an number t(G, H) is dened to be
t(G, H) = maxe(G

)[ : G

is a subgraph of G containing no H.
The classical Turan number is the special case that G is a complete graph K
n
. Tur ans theorem implies
t(K
n
, K
t+1
) = (
t 1
t
+o(1))
_
n
2
_
.
In this paper, we will show that
t(G, K
t+1
) = (
t 1
t
+o(1))e(G) (1)
as long as certain spectral bounds of G are satised (to be specied in Section 4).
Since any t-partite subgraph of G contains no K
t+1
, the inequality t(G, K
t+1
) (1
1
t
+o(1))e(G) always
holds. Thus, equation (1) implies that a maximum t-partite subgraph of G is an extremal graph having the

University of California, San Diego

Research supported in part by NSF Grants DMS 0457215, ITR 0205061 and ITR 0426858
1
maximum number of edges among all subgraphs of G containing no K
t+1
. In section 4, we will show that
our main theorem implies (the asymptotical version of) the classical Tur ans Theorem as a special case.
Another consequence of our main theorem is the result in [6] for d-regular graphs. Namely, if the second
largest eigenvalue of the adjacency matrix of a d-regular graph on n vertices satises d
t
/n
t1
, then
t(G, K
t+1
) = (1 1/t +o(1))dn/2. This will also be proved in Section 4.
In order to derive the relationship between the spectral bounds and the Tur an property, we will rst
consider eigenvalues of the (normalized) Laplacian. Detailed denitions will be given in the next section.
The connection between eigenvalues of the Laplacian and Turan numbers depends on a notion of gener-
alized volumes: For a subset X of vertices in a graph G, the k-volume of X is dened by
vol
k
(X) =

vX
d
k
v
,
where d
v
denotes the degree of v in G. We will rst describe several key properties of graphs which are
consequences of spectral gaps. In particular, we will give several general isoperimetric inequalities in Section
3. These inequalities provide good estimates for the discrepancies of a graph. We will use these inequalities
to establish the relationship between eigenvalues and the Turan property. We will show that if the non-zero
eigenvalues of the (normalized) Laplacian are bounded (depending on t and the volumes of G), then the
graph is t-Tur an. The proofs are given in Section 4.
2 Preliminaries on eigenvalues
For a graph G, there are several ways to evaluate eigenvalues by associating various matrices with G. A
typical matrix is the adjacency matrix A = A
G
which has entries A(u, v) = 1 if u and v are adjacent, and 0
otherwise. Another matrix is the combinatorial Laplacian L which is dened as L = D A where D is the
diagonal matrix with diagonal entries D(v, v) = d
v
where d
v
is the degree of the vertex v. The well-known
matrix-tree theorem of Kirchho [4] states that the number of spanning trees in a graph G is the product
of all (except for the smallest) eigenvalues of L divided by the number of vertices of G. The eigenvalues of
the adjacency matrix are useful in enumerating walks in a graph. For example, the largest eigenvalue of A,
denoted by |A|, is the limit of the k-th root of the number of k-walks in G, as k approaches innity. In this
paper, we will mainly focus on the (normalized) Laplacian L, which is dened as follows:
L(u, v) =
_

_
1
A(v,v)
dv
if u = v and d
v
,= 0

d
u
d
v
if u and v are adjacent,
0 otherwise.
2
We can write
L = D
1/2
LD
1/2
with the convention D
1
(v, v) = 0 for d
v
= 0.
For a regular graph with degree d, we have
L = I
1
d
A.
Let g denote an arbitrary function which assigns to each vertex v of G a real value g(v). We can view g
as a column vector. Then
g, Lg)
g, g)
=
g, D
1/2
LD
1/2
g)
g, g)
=
f, Lf)
D
1/2
f, D
1/2
f)
=

uv
(f(u) f(v))
2

v
f(v)
2
d
v
(2)
where g = D
1/2
f and

uv
denotes the sum over all unordered pairs u, v for which u and v are adjacent.
Here f, g) =

x
f(x)g(x) denotes the standard inner product in R
n
. (We note that we can also use the inner
product f, g) =

f(x)g(x) for complex-valued functions.) From equation (2), we see that all eigenvalues
are non-negative and 0 is an eigenvalue of L. We denote the eigenvalues of L by 0 =
0

1

n1
.
Let 1 denote the constant function which assumes the value 1 on each vertex. Then D
1/2
1 is an eigenfunction
of L with eigenvalue 0.
Quite a few basic facts can be derived from the above denition (see [2]). All
i
are between 0 and 2.
The number of eigenvalues of L having value 0 is the same as the number of connected components in G.
The maximum eigenvalue of L is 2 if and only if the graph is bipartite. In the next few sections, we will
focus on the family T

of graphs with Laplacian eigenvalues satisfying

= max
i=0
[1
i
[ < (3)
for i ,= 0. We note that for d-regular graphs, the eigenvalues of the adjacency matrix are just d(1
i
) so
the so-called (n, d, )-graphs in [1, 5] are in T

for =

/d.
3 Eigenvalues and discrepancies
A main tool for investigating various graph invariants for T

concerns the notion of discrepancy and the

related discrepancy inequalities. A typical denition for discrepancy is the dierence between the actual
3
quantity and the expected value. The goal is to upper bound the discrepancy in terms of eigenvalues. For
example, in a given graph G, a quantity of concern is the number e(X, Y ) of edges between two subsets X and
Y . In many situations (such as G is regular), the expected value of e(X, Y ) is taken to be the edge density
multiplied by the cardinality of X and Y . The condition of the graph being regular is quite restrictive. In
particular, such an inequality cannot be applied to (non-regular) subgraphs of a regular graph. Here we
extend such a discrepancy inequality to general graphs by using the eigenvalues of the Laplacian.
Lemma 1 Suppose a graph G on n vertices has eigenvalues
i
of the Laplacian satisfying

= max
i=0
[1

i
[ < . For any two subsets X and Y of vertices, e(X, Y ) denotes the number of ordered pairs (x, y) so that
x, y is an edge and x X and y Y . Then e(X, Y ) satises
[e(X, Y )
vol(X)vol(Y )
vol(G)
[
_
vol(X)vol(Y )
where vol(X) =

xX
d
x
and vol(G) =

v
d
v
.
The above lemma is a special case of the following:
Lemma 2 Suppose k is a given real value (possibly negative) and a graph G on n vertices has Laplacian
eigenvalues
i
satisfying

= max
i=0
[1
i
[ < . Then for any two subsets X and Y of vertices, the k-weight
of X and Y , denoted by
e
k
(X, Y ) =

uX

vY,vu
d
k
u
d
k
v
satises
[e
k
(X, Y )
vol
k+1
(X)vol
k+1
(Y )
vol(G)
[
_
vol
2k+1
(X)vol
2k+1
(Y )
where vol
i
(X) =

xX
d
i
x
and vol
i
(G) =

v
d
i
v
.
Proof: We dene

X
(u) =
_
d
k
u
if u X,
0 otherwise.
Then
[e
k
(X, Y )
vol
k+1
(X)vol
k+1
(Y )
vol(G)
[
= [
X
, A
Y
)
vol
k+1
(X)vol
k+1
(Y )
vol(G)
[
= [
X
, D
1/2
(I L)D
1/2

Y
)
vol
k+1
(X)vol
k+1
(Y )
vol(G)
[
= [
X
, D
1/2
(I L

0
)D
1/2

Y
)[
4
since the eigenvector
0
associated with eigenvalue 0 has coordinates
_
d
v
/vol(G), where f

denotes the
transpose of f. Since G is in T

, we have
|I L

0
| .
Therefore
[e
k
(X, Y )
vol
k+1
(X)vol
k+1
(Y )
vol(G)
[ |D
1/2

X
| |I L

0
| |D
1/2

Y
|
=
_
vol
2k+1
(X)
_
vol
2k+1
(Y )
as desired.
For a vertex v in a graph G, the neighborhood (v) of v is dened by
(v) = u : u v = u : u, v is an edge.
In general, the neighborhood
X
(v) of v in X is denoted by

X
(v) = u X : u v.
In addition to Lemma 2, we also need the following estimate:
Lemma 3 Suppose a graph G on n vertices has Laplacian eigenvalues
i
satisfying

= max
i=0
[1
i
[ < .
For any real value k and any subset X of vertices of G, we have

vX
1
d
v
_
vol
k
(
X
(v)) d
v
vol
k+1
(X)
vol(G)
_
2

2
vol
2k+1
(X)
where
X
(v) = u X : u v.
Proof: We consider
X
as dened in the proof of Lemma 2. The dierence of (I L)D
1/2

X
and the
projection of D
1/2

X
on D
1/2
1 can be written as:
|D
1/2
A
X
D
1/2

X
, D
1/2
1)
D
1/2
1
vol(G)
| |D
1/2

X
|
which implies

vX
1
d
v
_
vol
k
(
X
(v)) d
v
vol
k+1
(X)
vol(G)
_
2

2
vol
2k+1
(X)
as desired.
5
Lemma 4 Suppose a graph G on n vertices has Laplacian eigenvalues
i
satisfying

= max
i=0
[1
i
[ < .
Suppose X is a subset of vertices of G and v is a vertex in X. Let
X
(v) denote the neighborhood of v in X
and let R(v) denote a subset of (v). We have

vX
[
X
(v)[
2
d
v

vol
3
(X)
vol
2
(G)
+O(
vol
2
(X)
vol(G)
) +O(
2
vol(X)). (4)
and

vX
[
X
(v)[ [R(v)[
d
v

vX
[R(v)[vol(X)
vol(G)
+O(
vol
2
(X)
vol(G)
) +O(
2
vol(X)) (5)
Proof: Using Lemma 3, we have

vX
[
X
(v)[
2
d
v
=

vX
d
v
vol
2
(X)
vol
2
(G)
+

vX
[
X
(v)[
2
d
2
v
vol
2
(X)/vol
2
(G)
d
v

vol
3
(X)
vol
2
(G)
+O(
vol
2
(X)
vol(G)
) +O(
2
vol(X)).

vX
[
X
(v)[ [R(v)[
d
v
=

vX
[R(v)[vol(X)
vol(G)
+

vX
[R(v)[([
X
(v)[ d
v
vol(X)/vol(G))
d
v

vX
[R(v)[vol(X)
vol(G)
+

vol(X)(

vX
[R(v)[
2
d
v
)

vX
[R(v)[vol(X)
vol(G)
+O(
vol(X)
2
vol(G)
) +O(
2
vol(X)).

A useful generalization of Lemma 4 is the following:

Lemma 5 Suppose a graph G on n vertices has Laplacian eigenvalues
i
satisfying

= max
i=0
[1
i
[ < .
Suppose X is a subset of vertices of G and i is a non-negative value. We have

vX
1
d
i+1
v
(vol
i
(
X
(v)))
2
=
vol
3
i+1
(X)
vol
2
(G)
+O(
vol
i+1
(X)vol
2i+1
(X)
vol(G)
)
and

vX
1
d
i+1
v
vol
i
(
X
(v))vol
i
(R(v))
=
vol
i+1
(X)
vol(G)

{u,v}red
1
d
i
v
d
i
u
+O(

vol
i+1
(X)vol
2i+1
(X)
vol(G)
).
6
Proof:

vX
1
d
i+1
v
(vol
i
(
X
(v)))
2
=
vol
3
i+1
(X)
vol
2
(G)
+

vX
vol
2
i
(
X
(v)) (d
v
vol
i+1
(X)/vol(G))
2
d
i+1
v
=
vol
3
i+1
(X)
vol
2
(G)
+O(

vol
i+1
(X)vol
2i+1
(X)
vol(G)
),

vX
1
d
i+1
v
vol
i
(R(v))vol
i
(
X
(v)) =

vX
1
d
i
v
vol
i
(R(v))
vol
i+1
(X)
vol(G)
+

vX
1
d
i+1
v
vol
i
(R(v))(vol
i
(
X
(v))
d
v
vol
i+1
(X)
vol(G)
)
=
vol
i+1
(X)
vol(G)

{u,v}red
1
d
i
v
d
i
u
+O(

vol
i+1
(X)vol
2i+1
(X)
vol(G)
).

Lemma 6 Suppose that X is a subset of vertices in a graph G and are non-negative values. Then
vol

(X)vol

(X) vol
+1
(X)vol
1
(X). (6)
Proof: The inequality (6) follows from the following general version of the Cauchy-Schwarz inequality for
positive a
j
s and 0 :
(
k

j=1
a

j
)(
k

j=1
a

j
) (
k

j=1
a
1
j
)(
k

j=1
a
+1
j
).
By choosing a
j
s to be the reciprocal of the degrees, (6) is an immediate consequence.
4 A generalization of Turans theorem
We will now prove the main theorem:
Theorem 1 Suppose a graph G on n vertices has eigenvalues 0 =
0

1
. . .
n1
with

=
max
i=0
[1
i
[ satisfying

= o(
1
vol
2t+3
(G)vol(G)
t2
). (7)
Then, G is t-Tur an for t 2; i.e., any subgraph of G containing no K
t+1
has at most (1 1/t +o(1))e(G)
edges where e(G) is the number of edges in G.
7
There are expressions in terms of o()s in the statement of Theorem 1. To be precise, the result in
Theorem 1 can be restated as follows:
For any > 0, there is a such that if the eigenvalues of the Laplacian of the graph G satises

= max
i=0
[1
i
[ <

vol
2t+3
(G)vol(G)
t2
,
then any subgraph of G containing no K
t+1
has at most (1 1/t + )e(G) edges where e(G) is the number
of edges in G.
We remark that the condition in (7) has the following implication for the minimum degree of G.

1
vol
2t+3
(G)vol(G)
t2
<

2t3
vol(G)
t2
n


2t3
n
t1

t2
=

t1
n
t1
Since the inequality

1/

n
always holds, condition (7) implies that
n
(2t3)/(2t1)
.
Thus, condition (7) may hold only if the minimum degree of the graph G is suciently large.
Theorem 1 implies the following two facts the Classical Turan therem and the case for regular graphs,
Corollary 1 A graph on n vertices containing no K
t+1
has at most (1 1/t +o(1))n
2
/2 edges.
Proof: The complete graph on n vertices has Laplacian eigenvalues 0 and n/(n 1) (with multiplicity
n 1). Thus, for G = K
n
, it is always true that

=
1
n 1
= o(1).
Therefore, Theorem 1 implies that any graph on n vertices containing no K
t+1
has at most (11/t+o(1))n
2
/2
edges.
Corollary 2 If a graph is regular with degree d and has n vertices, then the condition in (7) is just

= o
_
(
d
n
)
t1
_
.
Then any subgraph of G containing no K
t+1
has at most (1 1/t +o(1))dn/2 edges.
8
The proof is by directly substitution and will be omitted.
Suppose that R is a subset of edges so that every K
t+1
in G contains at least one edge in R. In order to
prove Theorem 1, we wish to show that [R[ (1 +o(1))[E(G)[/t.
To do so, we will prove the following stronger result:
Theorem 2 Suppose a graph G on n vertices has eigenvalues satisfying (7). Then we have
(*) For any subset X of vertices in G and for non-negative integer k t, if R contains an edge from every
complete subgraph on k + 1 vertices, then we have, for all i, 0 i k,

vX,uX,{u,v}R
1
d
i
u
d
i
v

vol
2
i+1
(X)
kvol(G)
+O
_
_

k1

j=0
vol
2i2j+1
(X)vol
j
(G)
_
_
(8)
To derive Theorem 1 from Theorem 2, suppose that R contains an edge from every complete subgraph on
k + 1 vertices. We apply (*) with i = 0 and k = t. We then use (7) and have
[R[
vol(G)
t
+O(

t1

j=0
vol
2j+1
(G)vol
j
(G))

vol(G)
t
(1 +O(

vol
2t+3
(G)vol
t2
(G)))
(1 +o(1))
vol(G)
t
.
Therefore G is t-Tur an, as claimed.
5 Proofs of the main theorems
In this section, we shall prove Theorem 2. The inequality in (*) is somewhat complicated. We shall deal
with simpler cases rst (such as i = 0) which contain the main ideas.
Proof of Theorem 2:
First we want to show that (*) holds for k = 1. In this case we have R = E(G). Lemma 2 implies that
(*) holds for k = 1.
Suppose that k 2 and (*) holds for k

< k. We wish to prove (*) for k. Suppose R contains an edge

from every complete subgraph on k + 1 vertices. We want to show that the inequality (8) holds for all i,
0 i k.
We shall rst prove the case that i = 0. Suppose that edges in R are colored red and the rest of the edges
of G are blue. We focus on edges inside of the given set X. Recall that
X
(v) = (v) X. For each vertex
v, let R(v) and B(v) denote the set of neighbors u of v in X with u, v red and blue, respectively. For a
9
vertex v, we consider the induced subgraph on B(v) which does not contain a complete graph on k vertices.
By induction we have

u,wB(v),{u,w}red
1
d
u
d
w

1
(k 1)
[B(v)[
2
vol(G)
+O
_
_

k2

j=0
vol
2j1
(B(v))vol
j
(G)
_
_
. (9)
We consider the set T
j
of all triangles in X containing exactly j red edges, for j = 1, 2, 3.
W
1
=

{u,v,w}T1
2
d
v
d
u
d
w
=

vX
1
d
v

u,wB(v),{u,w}red
1
d
u
d
w

vX
1
d
v

uR(v)

wX(v)(u)
1
d
u
d
w

{v,u,w}T2
2
d
v
d
u
d
w

{v,u,w}T3
3
d
v
d
u
d
w

vX
1
d
v

uR(v)

wX(v)(u)
1
d
u
d
w
2W
2
3W
3
We note that
W
2
+ 3W
3
=

vX
1
d
v

u,wR(v),uw
1
d
u
d
w
.
Thus,
W
1

vX
1
d
v

uR(v)

wX(v),wu
1
d
u
d
w
W
2
3W
3

vX
1
d
v

uR(v)

wX(v),wu
1
d
u
d
w

vX
1
d
v

u,wR(v),uw
1
d
u
d
w
.
By Lemma 2, we have

uR(v)

wX(v),wu
1
d
u
d
w
=
[R(v)[ [
X
(v)[
vol(G)
+O(

_
vol
1
R(v)vol
1
(
X
(v)))

u,wR(v),uw
1
d
u
d
w
=
[R(v)[
2
vol(G)
+O(

vol
1
(R(v)).
Therefore,
W
1

vX
1
d
v
[
X
(v)[ [R(v)[
vol(G)

vX
1
d
v
[R(v)[
2
vol(G)
+O(

vX
vol
1
(
X
(v))
d
v
). (10)
10
On the other hand, from (10) we have
W
1
=

{u,v,w}T1
2
d
v
d
u
d
w

1
(k 1)

vX
1
d
v
[B(v)[
2
vol(G)
O(

k2

j=0
vol
2j1
(B(v))vol
j
(G)
d
v
)

1
(k 1)

vX
1
d
v
[B(v)[
2
vol(G)
O(

k2

j=0
vol
2j1
(
X
(v))vol
j
(G)
d
v
)

1
(k 1)

vX
1
d
v
([
X
(v)[ [R(v)[)
2
vol(G)
O(

k2

j=0
[X[vol
2j
(X)vol
j
(G)
vol(G)
)
+O(

2
k2

j=0
_
vol
1
(X)vol
4j1
(X)vol
j
(G)).
We note that the terms involving

2
are of lower order by using the assumption on

. Combining the
preceding upper and lower bounds for W
1
, we have
(k + 1)

vX
[
X
(v)[ [R(v)[
d
v

vX
[
X
(v)[
2
d
v
+k

vX
[R(v)[
2
d
v
O
_
_
[X[
k2

j=0
vol
2j
(X)vol
j
(G)
_
_
. (11)
By Lemma 4 and inequality (5), we have

vX
[
X
(v)[ [R(v)[
d
v

vX
[R(v)[vol(X)
vol(G)
+O(

vol(X)
2
vol(G)
) +O(

2
vol(X))
Also, by Lemma 4 and inequality (4), we have

vX
[
X
(v)[
2
d
v

vol
3
(X)
vol
2
(G)
+O(

vol(X)
2
vol(G)
) +O(

2
vol(X)).
Substituting into (11), we have
(k + 1)

v
[R(v)[
vol(X)
vol(G)

vol
3
(X)
vol
2
(G)
+k

vX
[R(v)[
2
d
v
+O
_
_
(
vol(X)
2
vol(G)
+
k2

j=0
[X[vol
2j
(X)vol
j
(G))
_
_

vol
3
(X)
vol
2
(G)
+k
(

vX
[R(v)[)
2

vX
d
v
+O
_
_
(
vol(X)
2
vol(G)
+
k2

j=0
[X[vol
2j
(X)vol
j
(G))
_
_
.
This implies
(
vol
2
(X)
vol(G)

v
[R(v)[)(
vol
2
(X)
vol(G)
k

[R(v)[) +O
_
_
(
vol(X)
3
vol(G)
+
k2

j=0
[X[vol
2j
(X)vol
j
(G)vol(X)
_
_
< 0.
11
Thus we have
[R[ =
1
2

v
[R(v)[

1
2k
vol
2
(X)
vol(G)
+O
_
_
(vol(X) +
k2

j=0
[X[vol
2j
(X)vol
j+1
(G)
vol(X)
)
_
_

1
2k
vol
2
(X)
vol(G)
+O
_
_
(vol(X) +
k2

j=0
vol
2j1
(X)vol
j+1
(G))
_
_

1
k
[E(X)[ +O
_
_
(vol(X) +
k1

j=1
vol
2j+1
(X)vol
j
(G))
_
_

1
k
[E(X)[ +O
_
_

k1

j=0
vol
2j+1
(X)vol
j
(G)
_
_
.
We have completed the proof for the case i = 0.
Suppose i 1. For j = 1, 2, 3, we consider
W
(i)
j
=

{u,v,w}Tj
2
d
i
v
d
i
u
d
i
w
.
As before, we have
W
(i+1)
1

vX
1
d
i+1
v

uR(v)

wX(v)(u)
1
d
i+1
u
d
i+1
w
W
(i+1)
2
3W
(i+1)
3

vX
1
d
i+1
v

uR(v)

wX(v)(u)
1
d
i+1
u
d
i+1
w

vX
1
d
i+1
v

u,wR(v),uw
1
d
i+1
u
d
i+1
w

vX
1
d
i+1
v
vol
i
(R(v))vol
i
(
X
(v))
vol(G)

vX
1
d
i+1
v
vol
2
i
(R(v))
vol(G)
+O(

vX
vol
2i1
(
X
(v))
d
i+1
v
)

vX
1
d
i+1
v
vol
i
(R(v))vol
i
(
X
(v))
vol(G)

vX
1
d
i+1
v
vol
2
i
(R(v))
vol(G)
+O(

vol
i
(X)vol
2i
(X)
vol(G)
+

2
(vol
2i1
(X)vol
4i1
(X))
1/2
).
12
On the other hand, by induction we have
W
(i+1)
1
=

{u,v,w}T1
2
d
(i+1)
v
d
(i+1)
u
d
(i+1)
w

1
(k 1)

vX
1
d
(i+1)
v
_
_
vol
2
i
(B(v))
vol(G)
+O(

k2

j=0
vol
2i2j+1
(B(v))vol
j
(G)
_
_

1
(k 1)

vX
1
d
i+1
v
vol
2
i
(
X
(v)) vol
i
(R(v))
vol(G)
+O
_
_

k2

j=0
vol
i
(X)vol
2i2j
(X)vol
j
(G)
vol(G)
+

2
k2

j=0
_
vol
2i1
(X)vol
4i4j1
(X)vol
j
(G)
_
_
.
By combining the upper and lower bounds of W
(i+1)
1
(and multiplying by vol(G)), we have
(k + 1)A +B kC +O(

Dvol(G)) (12)
where A, B, C, D are as follows:
A =

vX
1
d
i+1
v
(vol
i
(
X
(v)))
2

vol
3
i+1
(X)
vol
2
(G)
+O(

vol
i+1
(X)vol
2i+1
((v))
vol(G)
) by using Lemma 5.
B =

vX
1
d
i+1
v
vol
2
i
(R(v))
(

vX
vol
i
(R(v))
d
i
v
)
2
/vol
i+1
(G) by the Cauchy-Schwarz inequality.
C =

vX
1
d
i+1
v
vol
i
(
X
(v))vol
i
(R(v))

vol
i+1
(X)
vol(G)

{u,v}red
1
d
i
v
d
i
u
+O(

vol
i+1
(X)vol
2i+1
(X)
vol(G)
)
D =
k2

j=0
vol
i
(X)vol
2i2j
(X)vol
j
(G) + vol
i+1
(X)vol
2i+1
(X)
By substituting A, B and C into (12), we have the following:
k
vol
3
i+1
(X)
vol
2
(G)
+
(

{u,v}red
1
d
i
v
d
i
u
)
2
vol
i+1
(X)
(k + 1)
vol
i+1
(X)
vol(G)

{u,v}red
1
d
i
v
d
i
u
+O
_

Dvol(G)
_
.
This implies

{u,v}red
1
d
i
v
d
i
u

vol
2
i+1
(X)
kvol(G)
O
_
_
(vol
2i+1
(X) +
k2

j=0
vol
i
(X)vol
2i2j
(X)vol
j+1
(G)
vol
i+1
(X)
)
_
_
.
13
Now, by using Lemma 6 and inequality (6), we have

{u,v}red
1
d
i
v
d
i
u

vol
2
i+1
(X)
kvol(G)
+O(

vol
2i+1
(X) +
k2

j=0
vol
2i2j1
(X)vol
j+1
(G))

vol
2
i+1
(X)
kvol(G)
+O(

k1

j=0
vol
2i2j+1
(X)vol
j
(G)).
This completes the proof of Theorem 2.
References
[1] N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986), 86-96.
[2] F. Chung, Spectral Graph Theory, AMS Publications, 1997.
[3] F. Chung, L. Lu and V. Vu, Spectra of random graphs with given expected degrees, Proceedings of
National Academy of Sciences, 100, no. 11, (2003), 6313-6318.
[4] F. Kirchho,

Uber die Au osung der Gleichungen, auf welche man bei der Untersuchung der linearen
Verteilung galvanischer Str ome gef uhrt wird, Ann. Phys. chem. 72 (1847) 497-508.
[5] M. Krivelevich and B. Sudakov, Pseudo-random graphs, preprint.
[6] B. Sudakov, T. Szabo and V. Vu, A generalization of Tur ans theorem, J. Graph Theory, 49 (2005),
187-195.
14