- Source: Blow-up lemma
The blow-up lemma, proved by János Komlós, Gábor N. Sárközy, and Endre Szemerédi in 1997, is an important result in extremal graph theory, particularly within the context of the regularity method. It states that the regular pairs in the statement of Szemerédi's regularity lemma behave like complete bipartite graphs in the context of embedding spanning graphs of bounded degree.
Definitions and Statement
To formally state the blow-up lemma, we first need to define the notion of a super-regular pair.
= Super-regular pairs
=A pair
(
A
,
B
)
{\displaystyle (A,B)}
of subsets of the vertex set is called
(
ε
,
δ
)
{\displaystyle (\varepsilon ,\delta )}
-super-regular if for every
X
⊂
A
{\displaystyle X\subset A}
and
Y
⊂
B
{\displaystyle Y\subset B}
satisfying
|
X
|
>
ε
|
A
|
{\displaystyle |X|>\varepsilon |A|}
and
|
Y
|
>
ε
|
B
|
{\displaystyle |Y|>\varepsilon |B|}
we have
e
(
X
,
Y
)
>
δ
|
X
|
|
Y
|
{\displaystyle e(X,Y)>\delta |X||Y|}
and furthermore,
deg
(
a
)
>
δ
|
B
|
{\displaystyle \deg(a)>\delta |B|}
for all
a
∈
A
{\displaystyle a\in A}
and
deg
(
b
)
>
δ
|
A
|
{\displaystyle \deg(b)>\delta |A|}
for all
b
∈
B
{\displaystyle b\in B}
.
Here
e
(
X
,
Y
)
{\displaystyle e(X,Y)}
denotes the number of pairs
(
x
,
y
)
{\displaystyle (x,y)}
with
x
∈
X
{\displaystyle x\in X}
and
y
∈
Y
{\displaystyle y\in Y}
such that
{
x
,
y
}
{\displaystyle \{x,y\}}
is an edge.
= Statement of the Blow-up Lemma
=Given a graph
R
{\displaystyle R}
of order
r
{\displaystyle r}
and positive parameters
δ
,
Δ
{\displaystyle \delta ,\Delta }
, there exists a positive
ε
=
ε
(
δ
,
Δ
,
r
)
{\displaystyle \varepsilon =\varepsilon (\delta ,\Delta ,r)}
such that the following holds. Let
n
1
,
n
2
,
…
,
n
r
{\displaystyle n_{1},n_{2},\dots ,n_{r}}
be arbitrary positive integers and let us replace the vertices
v
1
,
v
2
,
…
,
v
r
{\displaystyle v_{1},v_{2},\dots ,v_{r}}
of
R
{\displaystyle R}
with pairwise disjoint sets
V
1
,
V
2
,
…
,
V
r
{\displaystyle V_{1},V_{2},\dots ,V_{r}}
of sizes
n
1
,
n
2
,
…
,
n
r
{\displaystyle n_{1},n_{2},\dots ,n_{r}}
(blowing up). We construct two graphs on the same vertex set
V
=
⋃
V
i
{\displaystyle V=\bigcup V_{i}}
. The first graph
R
{\displaystyle \mathbf {R} }
is obtained by replacing each edge
{
v
i
,
v
j
}
{\displaystyle \{v_{i},v_{j}\}}
of
R
{\displaystyle R}
with the complete bipartite graph between the corresponding vertex sets
V
i
{\displaystyle V_{i}}
and
V
j
{\displaystyle V_{j}}
. A sparser graph G is constructed by replacing each edge
{
v
i
,
v
j
}
{\displaystyle \{v_{i},v_{j}\}}
with an
(
ε
,
δ
)
{\displaystyle (\varepsilon ,\delta )}
-super-regular pair between
V
i
{\displaystyle V_{i}}
and
V
j
{\displaystyle V_{j}}
. If a graph
H
{\displaystyle H}
with
Δ
(
H
)
≤
Δ
{\displaystyle \Delta (H)\leq \Delta }
is embeddable into
R
{\displaystyle \mathbf {R} }
then it is already embeddable into G.
Proof Sketch
The proof of the blow-up lemma is based on using a randomized greedy algorithm (RGA) to embed the vertices of
H
{\displaystyle H}
into
G
{\displaystyle G}
sequentially. The argument then proceeds by bounding the failure rate of the algorithm such that it is less than 1 (and in fact
o
(
1
)
{\displaystyle o(1)}
) for an appropriate choice of parameters. This means that there is a non-zero chance for the algorithm to succeed, so an embedding must exist.
Attempting to directly embed all the vertices of
H
{\displaystyle H}
in this manner does not work because the algorithm may get stuck when only a small number of vertices are left. Instead, we set aside a small fraction of the vertex set, called buffer vertices, and attempt to embed the rest of the vertices. The buffer vertices are subsequently embedded by using Hall's marriage theorem to find a perfect matching between the buffer vertices and the remaining vertices of
G
{\displaystyle G}
.
= Notation
=We borrow all notation introduced in previous sections. Let
n
=
|
V
(
G
)
|
=
∑
n
i
{\displaystyle n=|V(G)|=\sum n_{i}}
. Since
H
{\displaystyle H}
can be embedded into
R
{\displaystyle \mathbf {R} }
, we can write
V
(
H
)
=
X
=
⋃
i
≤
r
X
i
{\displaystyle V(H)=X=\bigcup _{i\leq r}X_{i}}
with
|
X
i
|
=
|
V
i
|
{\displaystyle |X_{i}|=|V_{i}|}
for all
i
{\displaystyle i}
. For a vertex
x
∈
X
i
{\displaystyle x\in X_{i}}
, let
V
x
{\displaystyle V_{x}}
denote
V
i
{\displaystyle V_{i}}
. For
x
∈
X
i
,
y
∈
X
j
{\displaystyle x\in X_{i},y\in X_{j}}
,
d
x
y
=
e
(
V
i
,
V
j
)
|
V
i
|
|
V
j
|
{\displaystyle d_{xy}={\frac {e(V_{i},V_{j})}{|V_{i}||V_{j}|}}}
denotes the density of edges between the corresponding vertex sets of
G
{\displaystyle G}
.
ϕ
:
V
(
G
)
→
V
(
H
)
{\displaystyle \phi :V(G)\to V(H)}
is the embedding that we wish to construct.
T
{\displaystyle T}
is the final time after which the algorithm concludes.
= Outline of the algorithm
=Phase 0: Initialization
Greedily choose the set of buffer vertices
B
{\displaystyle B}
from the vertices of
H
{\displaystyle H}
as a maximal set of vertices distance at least
4
{\displaystyle 4}
from each other
Order the remaining vertices (those in
H
∖
B
{\displaystyle H\setminus B}
) in a list
L
{\displaystyle L}
, placing the neighbors of
B
{\displaystyle B}
first.
Declare a queue
q
{\displaystyle q}
of presently prioritized vertices, which is initially empty.
Declare an array of sets
F
z
{\displaystyle F_{z}}
indexed by the vertices of
H
{\displaystyle H}
, representing the set of all "free spots" of
z
{\displaystyle z}
, that is, the set of unoccupied vertices in
G
{\displaystyle G}
the vertex
z
{\displaystyle z}
could be mapped to without violating any of the adjacency conditions from the already-embedded neighbors of
z
{\displaystyle z}
in
H
{\displaystyle H}
.
F
z
{\displaystyle F_{z}}
is initialized to
V
z
{\displaystyle V_{z}}
.
Phase 1: Randomized Greedy Embedding
Choose a vertex
x
{\displaystyle x}
from the set of remaining vertices as follows:
If the queue
q
{\displaystyle q}
of prioritized vertices is non-empty, then choose the vertex from
q
{\displaystyle q}
Otherwise, choose a vertex from the list
L
{\displaystyle L}
of remaining vertices
Choose the image
ϕ
(
x
)
{\displaystyle \phi (x)}
in
G
{\displaystyle G}
for the vertex
x
{\displaystyle x}
randomly from the set of "good" choices, where a choice is good iff none of the new free-sets
F
z
(
t
)
{\displaystyle F_{z}(t)}
differ too much in size from the expected value.
Update the free sets
F
z
(
t
)
{\displaystyle F_{z}(t)}
, and put vertices whose free sets have become too small with respect to their size in the last update in the set of prioritized vertices
q
{\displaystyle q}
Abort if the queue
q
{\displaystyle q}
contains a sufficiently large fraction of any of the sets
X
i
{\displaystyle X_{i}}
If there are non-buffer vertices left to be embedded in either
L
{\displaystyle L}
or
q
{\displaystyle q}
, update time
t
{\displaystyle t}
and go back to step 1; otherwise move on to phase 2.
Phase 2: Kőnig-Hall matching for remaining vertices
Consider the set of vertices left to be embedded, which is precisely
B
{\displaystyle B}
, and the set of free spots
⋃
b
∈
B
F
b
(
T
)
{\displaystyle \bigcup _{b\in B}F_{b}(T)}
. Form a bipartite graph between these two sets, joining each
b
∈
B
{\displaystyle b\in B}
to
F
b
(
T
)
{\displaystyle F_{b}(T)}
, and find a perfect matching in this bipartite graph. Embed according to this matching.
= Proof of correctness
=The proof of correctness is technical and quite involved, so we omit the details. The core argument proceeds as follows:
Step 1: most vertices are good, and enough vertices are free
Prove simultaneously by induction on
t
{\displaystyle t}
that if
x
{\displaystyle x}
is the vertex embedded at time
t
{\displaystyle t}
, then
only a small fraction of the choices in
F
x
(
t
)
{\displaystyle F_{x}(t)}
are bad
all of the free sets
F
z
(
t
+
1
)
{\displaystyle F_{z}(t+1)}
are fairly large for unembedded vertices
z
{\displaystyle z}
Step 2: the "main lemma"
Consider
1
≤
i
≤
r
,
Y
⊆
X
i
{\displaystyle 1\leq i\leq r,Y\subseteq X_{i}}
, and
A
⊆
V
i
{\displaystyle A\subseteq V_{i}}
such that
|
A
|
{\displaystyle |A|}
is not too small. Consider the event
E
A
,
Y
{\displaystyle E_{A,Y}}
where
no vertices are embedded in
A
{\displaystyle A}
during the first phase
for every
y
∈
Y
{\displaystyle y\in Y}
there is a time
t
y
{\displaystyle t_{y}}
such that the fraction of free vertices of
y
{\displaystyle y}
in
A
{\displaystyle A}
at time
t
{\displaystyle t}
was small.
Then, we prove that the probability of
E
A
,
Y
{\displaystyle E_{A,Y}}
happening is low.
Step 3: phase 1 succeeds with high probability
The only way that the first phase could fail is if it aborts, since by the first step we know that there is always a sufficient choice of good vertices. The program aborts only when the queue is too long. The argument then proceeds by union-bounding over all modes of failure, noting that for any particular choice of
1
≤
i
≤
r
{\displaystyle 1\leq i\leq r}
,
Y
⊆
X
i
,
|
Y
|
≥
δ
Q
|
X
i
|
{\displaystyle Y\subseteq X_{i},|Y|\geq \delta _{Q}|X_{i}|}
and
A
=
V
i
{\displaystyle A=V_{i}}
with
Y
{\displaystyle Y}
representing a subset of the queue that failed, the triple
(
i
,
Y
,
A
)
{\displaystyle (i,Y,A)}
satisfy the conditions of the "main lemma", and thus have a low probability of occurring.
Step 4: no queue in initial phase
Recall that the list was set up so that neighbors of vertices in the buffer get embedded first. The time until all of these vertices get embedded is called the initial phase. Prove by induction on
t
{\displaystyle t}
that no vertices get added to the queue during the initial phase. It follows that all of the neighbors of the buffer vertices get added before the rest of the vertices.
Step 5: buffer vertices have enough free spots
For any
x
∈
B
{\displaystyle x\in B}
and
v
∈
V
x
{\displaystyle v\in V_{x}}
, we can find a sufficiently large lower bound on the probability that
ϕ
(
N
H
(
x
)
)
⊆
N
G
(
v
)
{\displaystyle \phi (N_{H}(x))\subseteq N_{G}(v)}
, conditional on the assumption that
v
{\displaystyle v}
was free before any of the vertices in
N
H
(
x
)
{\displaystyle N_{H}(x)}
were embedded.
Step 6: phase 2 succeeds with high probability
By Hall's marriage theorem, phase 2 fails if and only if Hall's condition is violated. For this to happen, there must be some
1
≤
i
≤
r
{\displaystyle 1\leq i\leq r}
and
S
⊆
X
i
{\displaystyle S\subseteq X_{i}}
such that
|
⋃
z
∈
S
F
z
(
T
)
|
<
|
S
|
{\displaystyle |\bigcup _{z\in S}F_{z}(T)|<|S|}
.
|
S
|
{\displaystyle |S|}
cannot be too small by largeness of free sets (step 1). If
|
S
|
{\displaystyle |S|}
is too large, then with high probability
⋃
z
∈
S
F
z
(
T
)
=
V
i
(
T
)
{\displaystyle \bigcup _{z\in S}F_{z}(T)=V_{i}(T)}
, so the probability of failure in such a case would be low. If
|
S
|
{\displaystyle |S|}
is neither too small nor too large, then noting that
A
:=
V
i
(
T
)
∖
⋃
z
∈
S
F
z
(
T
)
{\displaystyle A:=V_{i}(T)\setminus \bigcup _{z\in S}F_{z}(T)}
is a large set of unused vertices, we can use the main lemma and union-bound the failure probability.
Applications
The blow-up lemma has a number of applications in embedding dense graphs.
= Pósa-Seymour Conjecture
=In 1962, Lajos Pósa conjectured that every
n
{\displaystyle n}
-vertex graph with minimum degree at least
2
n
3
{\displaystyle {\frac {2n}{3}}}
contains the square of a Hamiltonian cycle, generalizing Dirac's theorem. The conjecture was further extended by Paul Seymour in 1974 to the following:
Every graph on
n
{\displaystyle n}
vertices with minimum degree at least
k
n
k
+
1
{\displaystyle {\frac {kn}{k+1}}}
contains the
k
{\displaystyle k}
-th power of a Hamiltonian cycle.
The blow-up lemma was used by Komlós, Sárközy, and Szemerédi to prove the conjecture for all sufficiently large values of
n
{\displaystyle n}
(for a fixed
k
{\displaystyle k}
) in 1998.
= Alon-Yuster Conjecture
=In 1995, Noga Alon and Raphael Yuster considered the generalization of the well-known Hajnal–Szemerédi theorem to arbitrary
H
{\displaystyle H}
-factors (instead of just complete graphs), and proved the following statement:
For every fixed graph
H
{\displaystyle H}
with
h
{\displaystyle h}
vertices, any graph G with n vertices and with minimum degree
d
≥
χ
(
H
)
−
1
χ
(
H
)
n
{\displaystyle d\geq {\frac {\chi (H)-1}{\chi (H)}}n}
contains
(
1
−
o
(
1
)
)
n
/
h
{\displaystyle (1-o(1))n/h}
vertex disjoint copies of H.
They also conjectured that the result holds with only a constant (instead of linear) error:
For every integer
h
{\displaystyle h}
there exists a constant
c
(
h
)
{\displaystyle c(h)}
such that for every graph
H
{\displaystyle H}
with
h
{\displaystyle h}
vertices, any graph
G
{\displaystyle G}
with
n
{\displaystyle n}
vertices and with minimum degree
d
≥
χ
(
H
)
−
1
χ
(
H
)
n
{\displaystyle d\geq {\frac {\chi (H)-1}{\chi (H)}}n}
contains at least
n
/
h
−
c
(
h
)
{\displaystyle n/h-c(h)}
vertex disjoint copies of
H
{\displaystyle H}
.
This conjecture was proven by Komlós, Sárközy, and Szemerédi in 2001 using the blow-up lemma.
History and Variants
The blow-up lemma, first published in 1997 by Komlós, Sárközy, and Szemerédi, emerged as a refinement of existing proof techniques using the regularity method to embed spanning graphs, as in the proof of the Bollobás conjecture on spanning trees, work on the Pósa-Seymour conjecture about the minimum degree necessary to contain the k-th graph power of a Hamiltonian cycle, and the proof of the Alon-Yuster conjecture on the minimum degree needed for a graph to have a perfect H-factor. The proofs of all of these theorems relied on using a randomized greedy algorithm to embed the majority of vertices, and then using a Kőnig-Hall like argument to find an embedding for the remaining vertices. The first proof of the blow-up lemma also used a similar argument. Later in 1997, however, the same authors published another paper that found an improvement to the randomized algorithm to make it deterministic.
Peter Keevash found a generalization of the blow-up lemma to hypergraphs in 2010.
Stefan Glock and Felix Joos discovered a variant of the blow-up lemma for rainbow graphs in 2018.
In 2019, Peter Allen, Julia Böttcher, Hiep Hàn, Yoshiharu Kohayakawa, and Yury Person, found sparse analogues of the blow-up lemma for embedding bounded degree graphs into random and pseudorandom graphs