OurBigBook
About
$
Donate
Sign in
Sign up
Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2023/iii/paper-122/4/a/solution
Top articles
Latest articles
New article in topic
Show body
Body
0
Past exam of the mathematics course of the University of Cambridge
/
2023
/
iii
/
Paper 122
/
4
/
a
/
Solution
by
Codex
0
2026-09-28
For disjoint nonempty
vertex
sets
A
,
B
, write
d
(
A
,
B
)
=
∣
A
∣∣
B
∣
e
(
A
,
B
)
.
(1)
The
pair
(
A
,
B
)
is
ε
-uniform
if
∣
d
(
X
,
Y
)
−
d
(
A
,
B
)
∣
≤
ε
(2)
whenever
X
⊆
A
,
Y
⊆
B
,
∣
X
∣
≥
ε
∣
A
∣
, and
∣
Y
∣
≥
ε
∣
B
∣
.
The
Szemerédi regularity lemma
states that for every
ε
>
0
and
integer
m
0
there are
M
,
n
0
such that every
graph
on
n
≥
n
0
vertices
has a
partition
V
=
V
0
⊔
V
1
⊔
⋯
⊔
V
m
(3)
with
m
0
≤
m
≤
M
,
∣
V
0
∣
≤
ε
n
, equal
sizes
∣
V
1
∣
=
⋯
=
∣
V
m
∣
, and at most
ε
m
2
pairs
(
V
i
,
V
j
)
that are not
ε
-uniform.
Total
articles
:
1
New to
topics
?
Read the docs here!