Counting lemma

The counting lemmas this article discusses are statements in combinatorics and graph theory. The first one extracts information from ${\displaystyle \epsilon }$-regular pairs of subsets of vertices in a graph ${\displaystyle G}$, in order to guarantee patterns in the entire graph; more explicitly, these patterns correspond to the count of copies of a certain graph ${\displaystyle H}$ in ${\displaystyle G}$. The second counting lemma provides a similar yet more general notion on the space of graphons, in which a scalar of the cut distance between two graphs is correlated to the homomorphism density between them and ${\displaystyle H}$.

Graph embedding version of counting lemma

Whenever we have an ${\displaystyle \epsilon }$-regular pair of subsets of vertices ${\displaystyle U,V}$ in a graph ${\displaystyle G}$, we can interpret this in the following way: the bipartite graph, ${\displaystyle (U,V)}$, which has density ${\displaystyle d(U,V)}$, is close to being a random bipartite graph in which every edge appears with probability ${\displaystyle d(U,V)}$, with some ${\displaystyle \epsilon }$ error.

In a setting where we have several clusters of vertices, some of the pairs between these clusters being ${\displaystyle \gamma }$-regular, we would expect the count of small, or local patterns, to be roughly equal to the count of such patterns in a random graph. These small patterns can be, for instance, the number of graph embeddings of some ${\displaystyle H}$ in ${\displaystyle G}$, or more specifically, the number of copies of ${\displaystyle H}$ in ${\displaystyle G}$ formed by taking one vertex in each vertex cluster.

The above intuition works, yet there are several important conditions that must be satisfied in order to have a complete statement of the theorem; for instance, the pairwise densities are at least ${\displaystyle \varepsilon }$, the cluster sizes are at least ${\displaystyle \gamma ^{-1}}$ , and ${\displaystyle \gamma \leq \varepsilon ^{h}/4h}$. Being more careful of these details, the statement of the graph counting lemma is as follows:

Statement of the theorem

If ${\displaystyle H}$ is a graph with vertices ${\displaystyle 1,\cdots ,h}$ and ${\displaystyle m}$ edges, and ${\displaystyle G}$ is a graph with (not necessarily disjoint) vertex subsets ${\displaystyle W_{1},\cdots ,W_{h}}$, such that ${\displaystyle |W_{i}|\geq \gamma ^{-1}}$ for all ${\displaystyle i=1,\ldots ,h}$ and for every edge ${\displaystyle (i,j)}$ of ${\displaystyle H}$ the pair ${\displaystyle (W_{i},W_{j})}$ is ${\displaystyle \gamma }$-regular with density ${\displaystyle d(W_{i},W_{j})>\varepsilon }$ and ${\displaystyle \gamma \leq \varepsilon ^{h}/4h}$, then ${\displaystyle G}$ contains at least ${\displaystyle 2^{-h}\varepsilon ^{m}|W_{1}|\cdot \ldots \cdot |W_{h}|}$ many copies of ${\displaystyle H}$ with the copy of vertex ${\displaystyle i}$ in ${\displaystyle W_{i}}$.

This theorem is a generalization of the triangle counting lemma, which states the above but with ${\displaystyle H=K_{3}}$:

Triangle counting Lemma

Let ${\displaystyle G}$ be a graph on ${\displaystyle n}$ vertices, and let ${\displaystyle X,Y,Z}$ be subsets of ${\displaystyle V(G)}$ which are pairwise ${\displaystyle \epsilon }$-regular, and suppose the edge densities ${\displaystyle d_{XY},d_{XZ},d_{YZ}}$ are all at least ${\displaystyle 2\epsilon }$. Then the number of triples ${\displaystyle (x,y,z)\in X\times Y\times Z}$ such that ${\displaystyle x,y,z}$ form a triangle in ${\displaystyle G}$ is at least$${\displaystyle (1-2\epsilon )(d_{XY}-\epsilon )(d_{XZ}-\epsilon )(d_{YZ}-\epsilon )|X||Y||Z|.}$$

Proof of triangle counting lemma:

Since ${\displaystyle (X,Y)}$ is a regular pair, less than ${\displaystyle \varepsilon |X|}$ of the vertices in ${\displaystyle X}$ have fewer than ${\displaystyle (d_{XY}-\varepsilon )|Y|}$ neighbors in ${\displaystyle Y}$; otherwise, this set of vertices from ${\displaystyle X}$ along with its neighbors in ${\displaystyle Y}$ would witness irregularity of ${\displaystyle (X,Y)}$, a contradiction. Intuitively, we are saying that not too many vertices in ${\displaystyle X}$ can have a small degree in ${\displaystyle Y}$.

By an analogous argument in the pair ${\displaystyle (X,Z)}$, less than ${\displaystyle \varepsilon |X|}$ of the vertices in ${\displaystyle X}$ have fewer than ${\displaystyle (d_{XZ}-\varepsilon )|Z|}$ neighbors in ${\displaystyle Z}$. Combining these two subsets of ${\displaystyle X}$ and taking their complement, we obtain a subset ${\displaystyle X'\subseteq X}$ of size at least ${\displaystyle (1-2\varepsilon )|X|}$ such that every vertex ${\displaystyle x\in X'}$ has at least ${\displaystyle (d_{XY}-\varepsilon )|Y|}$ neighbors in ${\displaystyle Y}$ and at least ${\displaystyle (d_{XZ}-\varepsilon )|Z|}$ neighbors in ${\displaystyle Z}$.

We also know that ${\displaystyle d_{XY},d_{XZ}\geq 2\varepsilon }$, and that ${\displaystyle (Y,Z)}$ is an ${\displaystyle \varepsilon }$-regular pair; therefore, the density between the neighborhood of ${\displaystyle x}$ in ${\displaystyle Y}$ and the neighborhood of ${\displaystyle x}$ in ${\displaystyle Z}$ is at least ${\displaystyle (d_{YZ}-\varepsilon )}$, because by regularity it is ${\displaystyle \varepsilon }$-close to the actual density between ${\displaystyle Y}$ and ${\displaystyle Z}$.

Summing up, for each of these at least ${\displaystyle (1-2\varepsilon )|X|}$ vertices ${\displaystyle x\in X'}$, there are at least ${\displaystyle (d_{XY}-\epsilon )(d_{XZ}-\epsilon )(d_{YZ}-\epsilon )|Y||Z|}$ choices of edges between the neighborhood of ${\displaystyle x}$ in ${\displaystyle Y}$ and the neighborhood of ${\displaystyle x}$ in ${\displaystyle Z}$. From there we can conclude this proof.

Idea of proof of graph counting lemma:The general proof of the graph counting lemma extends this argument through a greedy embedding strategy; namely, vertices of ${\displaystyle H}$ are embedded in the graph one by one, by using the regularity condition so as to be able to keep a sufficiently large set of vertices in which we could embed the next vertex.[1]

Graphon version of counting lemma

The space ${\displaystyle {\tilde {\mathcal {W}}}_{0}}$ of graphons is given the structure of a metric space where the metric is the cut distance ${\displaystyle \delta _{\Box }}$. The following lemma is an important step in order to prove that ${\displaystyle ({\tilde {\mathcal {W}}}_{0},\delta _{\Box })}$ is a compact metric space. Intuitively, it says that for a graph ${\displaystyle F}$, the homomorphism densities of two graphons with respect to this graph have to be close (this bound depending on the number of edges ${\displaystyle F}$) if the graphons are close in terms of cut distance.

Definition (cut norm).

The cut norm of ${\displaystyle W:[0,1]^{2}\to \mathbb {R} }$ is defined as ${\displaystyle \|W\|_{\square }=\sup _{S,T\subseteq [0,1]}\left|\int _{S\times T}W\right|}$, where ${\displaystyle S}$ and ${\displaystyle T}$ are measurable sets.

Definition (cut distance).

The cut distance is defined as ${\displaystyle \delta _{\square }(U,W)=\inf _{\phi }||U-W^{\phi }||_{\square }}$, where ${\displaystyle W^{\phi }(x,y)}$ represents ${\displaystyle W(\phi (x),\phi (y))}$ for a measure-preserving bijection ${\displaystyle \phi }$.

Graphon Counting Lemma

For graphons ${\displaystyle W,U}$ and graph ${\displaystyle F}$, we have ${\displaystyle |t(F,W)-t(F,U)|\leq |E(F)|\delta _{\square }(W,U)}$, where ${\displaystyle |E(F)|}$ denotes the number of edges of graph ${\displaystyle F}$.

Proof of the graphon counting lemma:

It suffices to prove $${\displaystyle |t(F,W)-t(F,U)|\leq |E(F)|\|W-U\|_{\square }.}$$Indeed, by considering the above, with the right hand side expression having a factor ${\displaystyle \|W-U^{\phi }\|_{\Box }}$ instead of ${\displaystyle \|W-U\|_{\Box }}$, and taking the infimum of the over all measure-preserving bijections ${\displaystyle \phi }$, we obtain the desired result.

Step 1: Reformulation. We prove a reformulation of the cut norm, which is by definition the left hand side of the following equality. The supremum in the right hand side is taken among measurable functions ${\displaystyle u}$ and ${\displaystyle v}$:$${\displaystyle \sup _{S,T\subseteq [0,1]}\left|\int _{S\times T}W\right|=\sup _{u,v:[0,1]\rightarrow [0,1]}\left|\int _{[0,1]^{2}}W(x,y)u(x)v(y)dxdy\right|.}$$

Here's the reason for the above to hold: By taking ${\displaystyle u=\mathbb {1} _{S}}$ and ${\displaystyle u=\mathbb {1} _{T}}$, we note that the left hand side is less than or equal than the right hand side. The right hand side is less than or equal than the left hand side by bilinearity of the integrand in ${\displaystyle u,v}$, and by the fact that the extrema are attained for ${\displaystyle u,v}$ taking values at ${\displaystyle 0}$ or ${\displaystyle 1}$.

Step 2: Proof for ${\displaystyle F=K_{3}}$. In the case that ${\displaystyle F=K_{3}}$, we observe that

$${\displaystyle {\begin{aligned}t(K_{3},W)-t(K_{3},U)&=\int _{[0,1]^{3}}((W(x,y)W(x,z)W(y,z)-U(x,y)U(x,z)U(y,z))dxdydz\\&=\int _{[0,1]^{3}}(W-U)(x,y)W(x,z)W(y,z)dxdydz\\&\qquad +\int _{[0,1]^{3}}U(x,y)(W-U)(x,z)W(y,z)dxdydz\\&\qquad +\int _{[0,1]^{3}}U(x,y)U(x,z)(W-U)(y,z)dxdydz.\end{aligned}}}$$

By Step 1, we have that for a fixed ${\displaystyle z}$ that

${\displaystyle \left|\int _{[0,1]^{2}}(W-U)(x,y)W(x,z)W(y,z)dxdy\right|\leq \|W-U\|_{\square }}$

Therefore, when integrating over all ${\displaystyle z\in [0,1]}$ we get that

${\displaystyle \left|\int _{[0,1]^{3}}(W-U)(x,y)W(x,z)W(y,z)dxdydz\right|\leq \|W-U\|_{\square }}$

Using this bound on each of the three summands, we get that the whole sum is bounded by ${\displaystyle 3\|W-U\|_{\square }}$. Step 3: General case. For a general graph ${\displaystyle F}$, we need the following lemma to make everything more convenient:

Lemma.

The following expression holds:$${\displaystyle a_{1}a_{2}\cdots a_{n}-b_{1}b_{2}\cdots b_{n}=(a_{1}-b_{1})a_{2}\cdots a_{n}+b_{1}(a_{2}-b_{2})\cdots a_{n}+\cdots b_{1}b_{2}\cdots (a_{n}-b_{n}).}$$

The above lemma follows from a straightforward expansion of the right hand side. Then, by the triangle inequality of norm, we have the following$${\displaystyle {\begin{aligned}\left|t(F,W)-t(F,U)\right|&=\left|\int \left(\prod _{u_{i}v_{i}\in E(F)}W(u_{i},v_{i})-\prod _{u_{i}v_{i}\in E(F)}U(u_{i},v_{i})\right)\prod _{v\in V}dv\right|\\&\leq \sum _{i=1}^{|E(F)|}\left|\int \left(\ \prod _{j=1}^{i-1}U(u_{j},v_{j})(W(u_{i},v_{i})-U(u_{i},v_{i}))\prod _{k=i+1}^{|E(F)|}W(u_{k},v_{k})\right)\prod _{v\in V}dv\right|.\end{aligned}}}$$

Here, each absolute value term in the sum is bounded by the cut norm ${\displaystyle \|W-U\|_{\square }}$ if we fix all the variables except for ${\displaystyle u_{i}}$ and ${\displaystyle v_{i}}$ for each ${\displaystyle i}$-th term, altogether implying that ${\displaystyle |t(F,W)-t(F,U)|\leq |E(F)|\ \delta _{\square }(W,U)}$. This finishes the proof.

See also

• Graph removal lemma

References

1. Conlon, Fox, David, Jacob. "Graph Removal Lemmas" (PDF). David Conlon's webpage. Archived (PDF) from the original on 2013-10-01.