Hypergraph regularity method: Difference between revisions

Revision as of 00:21, 28 November 2021

Latest revision as of 02:09, 23 September 2024

(72 intermediate revisions by 17 users not shown)

Line 1:

{{Short description|Mathematical method in extremal graph theory}}

{{AfC submission|t||ts=20211127234938|u=Lepsvera|ns=118|demo=}}<!-- Important, do not remove this line before article has been created. -->

In mathematics, the '''hypergraph regularity method''' is a powerful tool in [[extremal graph theory]] that refers to the combined application of the hypergraph regularity lemma and the associated counting lemma. It is a generalization of the graph regularity method, which refers to the use of [[Szemerédi regularity lemma|Szemerédi's regularity]] and counting lemmas.

Very informally, the hypergraph regularity lemma decomposes any given <math> k </math>-uniform [[hypergraph]] into a random-like object with bounded parts (with an appropriate boundedness and randomness notions) that is usually easier to work with. On the other hand, the hypergraph counting lemma estimates the number of hypergraphs of a given isomorphism class in some collections of the random-like parts. This is an extension of [[Szemerédi regularity lemma|Szemerédi's regularity lemma]] that partitions any given graph into bounded number parts such that edges between the parts behave almost randomly. Similarly, the hypergraph counting lemma is a generalization of [[Szemerédi regularity lemma#Graph counting lemma|the graph counting lemma]] that estimates number of copies of a fixed graph as a subgraph of a larger graph.

There are several distinct formulations of the method, all of which imply the [[hypergraph removal lemma]] and a number of other powerful results, such as [[Szemerédi's theorem]], as well as some of its multidimensional extensions. The following formulations are due to [[Vojtěch Rödl|V. Rödl]], B. Nagle, J. Skokan, [[Mathias Schacht|M. Schacht]], and [[Yoshiharu Kohayakawa|Y. Kohayakawa]],<ref>{{Cite journal|last1=Rödl|first1=V.|last2=Nagle|first2=B.|last3=Skokan|first3=J.|last4=Schacht|first4=M.|last5=Kohayakawa|first5=Y.|date=2005-06-07|title=The hypergraph regularity method and its applications|journal=Proceedings of the National Academy of Sciences|language=en|volume=102|issue=23|pages=8109–8113|doi=10.1073/pnas.0502771102|issn=0027-8424|pmc=1149431|pmid=15919821 |doi-access=free }}</ref> for alternative versions see [[Terence Tao|Tao]] (2006),<ref>{{Cite journal|last=Tao|first=Terence|authorlink=Terence Tao|date=2006-10-01|title=A variant of the hypergraph removal lemma|journal=[[Journal of Combinatorial Theory]] | series=Series A|language=en|volume=113|issue=7|pages=1257–1280|doi=10.1016/j.jcta.2005.11.006|doi-access=free|issn=0097-3165|arxiv=math/0503572}}</ref> and [[Timothy Gowers|Gowers]] (2007).<ref name=":1">{{Cite journal|last=Gowers|first=William|date=2007-11-01|title=Hypergraph regularity and the multidimensional Szemerédi theorem|journal=Annals of Mathematics|volume=166|issue=3|pages=897–946|doi=10.4007/annals.2007.166.897|issn=0003-486X|doi-access=free|arxiv=0710.3032}}</ref>

== Introduction ==

regularity method is a powerful tool that refers to the combined application of hypergraph regularity lemma and associated counting lemma. It is a generalization of graph regularity method, which refers to the use of Szemerédi's regularity and counting lemmas.

Very informally, hypergraph regularity lemma decomposes any given <math> k </math>-uniform hypergraph into random-like object with bounded parts (with an appropriate boundedness and randomness notions) that is usually easier to work with.

On the other hand, hypergraph counting lemma estimates the number of hypergraphs of given isomorphism class in some collections of the random-like parts.

This is an extension of Szemerédi's regularity lemma that decomposes any given graph into pseudorandom blocks, namely <math> \varepsilon </math>-regular pairs, and graph counting lemma that estimates number of copies of a fixed graph as a subgraph of a larger graph.

There are several distinct formulations of the method, all of which imply hypergraph removal lemma and a number of other powerful results, such as Szemerédi's theorem, as well as some of its multidimensional extensions.

== Definitions ==

The following formulations are due to [insert names], for alternative versions see [insert names]. In order to state the hypergraph regularity and counting lemmas formally, we need to define several rather technical terms to formalize appropriate notions of [[Pseudorandomness|pseudo-randomness]] (random-likeness) and boundedness, as well as to describe the random-like blocks and partitions.

'''Notation'''

==== Notations ====

* <math> K_j^{(k)} </math> denotes a <math> k </math>-uniform clique on <math> j </math> vertices.

* <math> \mathcal{G}^{(j)} </math> is an <math> l </math>-partite <math> j </math>-graph on vertex partition <math> \mathcal{G}^{(1)} = V_1 \sqcup \ldots \sqcup V_l </math>.

* <math> \mathcal{K}_j(\mathcal{G}^{(i)}) </math> is the family of all <math> j </math>-element vertex sets that span the clique <math> K_j^{(i)} </math> in <math> \mathcal{G}^{(i)} </math>. In particular, <math> \mathcal{K}_j(\mathcal{G}^{(1)}) = K_l^{(j)}(V_1, \ldots, V_l) </math>, is a complete <math> l </math>-partite <math> j </math>-graph.

The following defines an important notion of relative density, which roughly describes the fraction of <math> j </math>-edges spanned by <math> (j-1) </math>-edges that are in the hypergraph. For example, when <math> j=3 </math>, the quantity <math>d(\mathcal{G}^{(3)} \vert \mathbf{Q}^{(2)})</math> is equal to the fraction of triangles formed by 2-edges in the subhypergraph that are 3-edges. <blockquote>'''Definition [Relative density].''' For <math> j \geq 3 </math>, fix some classes <math> V_{i_1}, \ldots, V_{i_j} </math> of <math> \mathcal{G}^{(1)} </math> with <math> 1 \leq i_1 < \ldots < i_j \leq l </math>. Suppose <math> r \geq 1 </math> is an integer. Let <math> \mathbf{Q}^{(j-1)} = \{ Q_1^{(j-1)}, \ldots, Q_r^{(j-1)} \} </math> be a subhypergraph of the induced <math> j </math>-partite graph <math> \mathcal{G}^{(j-1)}[V_{i_1}, \ldots, V_{i_j}] </math>. Define the relative density <math>d\left(\mathcal{G}^{(j)} \vert \mathbf{Q}^{(j-1)}\right) = \frac{\left|\mathcal{G}^{(j)} \cap \cup_{s \in [r]} \mathcal{K}_j(Q_s^{j-1})\right|}{\left|\cup_{s \in [r]} \mathcal{K}_j(Q_s^{j-1})\right|}</math>.</blockquote>What follows is the appropriate notion of pseudorandomness that the regularity method will use. Informally, by this concept of regularity, <math> (j-1) </math>-edges (<math> \mathcal{G}^{(j-1)} </math>) have some control over <math> j </math>-edges (<math> \mathcal{G}^{(j)} </math>). More precisely, this defines a setting where density of <math>j</math> edges in large subhypergraphs is roughly the same as one would expect based on the relative density alone. Formally,<blockquote>'''Definition [(<math> \delta_j, d_j, r </math>)-regularity].''' Suppose <math> \delta_j, d_j </math> are positive real numbers and <math> r \geq 1 </math> is an integer. <math> \mathcal{G}^{(j)} </math> is (<math> \delta_j, d_j, r </math>)-regular with respect to <math> \mathcal{G}^{(j-1)} </math> if for any choice of classes <math> V_{i_1}, \ldots, V_{i_j} </math> and any collection of subhypergraphs <math> \mathbf{Q}^{(j-1)} = \{ Q_1^{(j-1)}, \ldots, Q_r^{(j-1)} \} </math> of <math> \mathcal{G}^{(j-1)}[V_{i_1}, \ldots, V_{i_j}] </math> satisfying <math>\left|\cup_{s \in [r]}\mathcal{K}_j(Q_s)^{(j-1)}\right| \geq \delta_j \left|\mathcal{K}_j(\mathcal{G}^{(j-1)}[V_{i_1}, \ldots, V_{i_j}])\right|</math> we have <math> d(\mathcal{G}^{(j)} \vert \mathbf{Q}^{(j-1)}) = d_j \pm \delta_j </math>.</blockquote>Roughly speaking, the following describes the pseudorandom blocks into which the hypergraph regularity lemma decomposes any large enough hypergraph. In Szemerédi regularity, 2-edges are regularized versus 1-edges (vertices). In this generalized notion, <math> j </math>-edges are regularized versus <math> (j-1) </math>-edges for all <math> 2\leq j\leq h </math>. More precisely, this defines a notion of regular hypergraph called '''<math> (l, h) </math>'''-complex, in which existence of <math> j </math>-edge implies existence of all underlying <math> (j-1) </math>-edges, as well as their relative regularity. For example, if <math> \{x,y,z\} </math> is a 3-edge then <math> \{x,y\} </math>,<math> \{x,z\} </math>, and <math> \{y,z\} </math> are 2-edges in the complex. Moreover, the density of 3-edges over all possible triangles made by 2-edges is roughly the same in every collection of subhypergraphs.<blockquote>'''Definition [<math> (\delta, \mathbf{d},r) </math>-regular <math> (l, h) </math>-complex].''' An <math> (l,h) </math>-complex <math> \mathbf{G} </math> is a system <math> \{\mathcal{G}^{(j)}\}_{j=1}^h </math> of <math> l </math>-partite <math> j </math> graphs <math> \mathcal{G}^{(j)} </math> satisfying <math> \mathcal{G}^{(j)} \subset \mathcal{K}_j(\mathcal{G}^{(j-1)}) </math>. Given vectors of positive real numbers <math> \delta = (\delta_2, \ldots, \delta_h) </math>, <math> \mathbf{d} = (d_2, \ldots, d_h) </math>, and an integer <math> r \geq 1 </math>, we say <math> (l, h) </math>-complex is <math> (\delta, \mathbf{d},r) </math>-regular if

==== Relative density ====

For <math> j \geq 3 </math>, fix some classes <math> V_{i_1}, \ldots, V_{i_j} </math> of <math> \mathcal{G}^{(1)} </math> with <math> 1 \leq i_1 < \ldots < i_j \leq l </math>. Suppose <math> r \geq 1 </math> is an integer. Let <math> \mathbf{Q}^{(j-1)} = \{ Q_1^{(j-1)}, \ldots, Q_r^{(j-1)} \} </math> be a subhypergraph of the induced <math> j </math>-partite graph <math> \mathcal{G}^{(j-1)}[V_{i_1}, \ldots, V_{i_j}] </math>. Define the relative density

<math>d\left(\mathcal{G}^{(j)} \vert \mathbf{Q}^{(j-1)}\right) = \frac{\left|\mathcal{G}^{(j)} \cap \cup_{s \in [r]} \mathcal{K}_j(Q_s^{j-1})\right|}{\left|\cup_{s \in [r]} \mathcal{K}_j(Q_s^{j-1})\right|}</math>

The following is the appropriate notion of pseudorandomness that the regularity method will use. Informally, by this concept of regularity, <math> j-1 </math>-edges (<math> \mathcal{G}^{(j-1)} </math>) have some control over <math> j </math>-edges (<math> \mathcal{G}^{(j)} </math>).

==== (<math> \delta_j, d_j, r </math>)-regularity ====

Suppose <math> \delta_j, d_j </math> are positive real numbers and <math> r \geq 1 </math> is an integer. <math> \mathcal{G}^{(j)} </math> is (<math> \delta_j, d_j, r </math>)-regular with respect to <math> \mathcal{G}^{(j-1)} </math> if for any choice of classes <math> V_{i_1}, \ldots, V_{i_j} </math> and any collection of subhypergraphs <math> \mathbf{Q}^{(j-1)} = \{ Q_1^{(j-1)}, \ldots, Q_r^{(j-1)} \} </math> of <math> \mathcal{G}^{(j-1)}[V_{i_1}, \ldots, V_{i_j}] </math> satisfying

<math>\left|\cup_{s \in [r]}\mathcal{K}_j(Q_s)^{(j-1)}\right| \geq \delta_j \left|\mathcal{K}_j(\mathcal{G}^{(j-1)}[V_{i_1}, \ldots, V_{i_j}])\right|</math>

we have <math> d(\mathcal{G}^{(j)} \vert \mathbf{Q}^{(j-1)}) = d_j \pm \delta_j </math>

Roughly speaking, following describes the pseudorandom blocks into which the hypergraph regularity lemma decomposes any large enough hypergraph. In Szemerédi regularity 2-edges are regularized versus 1-edges (vertices). In this generalized notion, <math> j </math>-edges are regularized versus <math> (j-1) </math>-edges, for all <math> 2\leq j\leq h </math>.

==== <math> (\delta, \mathbf{d},r) </math>-regular <math> (l, h) </math>-complex ====

An <math> (l,h) </math>-complex <math> \mathbf{G} </math> is a system <math> \{\mathcal{G}^{(j)}\}_{j=1}^h </math> of <math> l </math>-partite <math> j </math> graphs <math> \mathcal{G}^{(j)} </math> satisfying <math> \mathcal{G}^{(j)} \subset \mathcal{K}_j(\mathcal{G}^{(j-1)}) </math>. Given vectors of positive real numbers <math> \delta = (\delta_2, \ldots, \delta_h) </math>, <math> \mathbf{d} = (d_2, \ldots, d_h) </math>, and an integer <math> r \geq 1 </math>, we say <math> (l, h) </math>-complex is <math> (\delta, \mathbf{d},r) </math>-regular if

* For each <math> 1 \leq i_1 < i_2 \leq l </math>, <math> \mathcal{G}^{(2)}[V_{i_1},V_{i_2}] </math> is <math> \delta_2 </math>-regular with density <math> d_2 \pm \delta_2 </math>.

* For each <math> 3 \leq j \leq h </math>, <math> \mathcal{G}^{(j)} </math> is (<math> \delta_j, d_j, r </math>)-regular with respect to <math> \mathcal{G}^{(j-1)} </math>.

</blockquote>The following describes the equitable partition that the hypergraph regularity lemma will induce. A <math> (\mu, \delta, \mathbf{d}, r) </math>-equitable family of partition is a sequence of partitions of 1-edges (vertices), 2-edges (pairs), 3-edges (triples), etc. This is an important distinction from the partition obtained by Szemerédi's regularity lemma, where only vertices are being partitioned. In fact, Gowers<ref name=":1" /> demonstrated that solely vertex partition can not give a sufficiently strong notion of regularity to imply Hypergraph counting lemma. <blockquote>'''Definition [<math> (\mu, \delta, \mathbf{d}, r) </math>-equitable partition].''' Let <math> \mu > 0 </math> be a real number, <math> r \geq 1 </math> be an integer, and <math> \delta = (\delta_2, \ldots, \delta_{k-1}) </math>, <math> \mathbf{d}=(d_2, \ldots, d_{k-1}) </math> be vectors of positive reals. Let <math> \mathbf{a} = (a_1, \ldots, a_{k-1}) </math> be a vector of positive integers and <math> V </math> be an <math> n </math>-element vertex set. We say that a family of partitions <math> \mathcal{P} = \mathcal{P}(k-1, \mathbf{a}) = \{\mathcal{P}^{(1)}\, \ldots, \mathcal{P}^{(k-1)}\} </math> on <math> V </math> is <math> (\mu, \delta, \mathbf{d}, r) </math>-equitable if it satisfies the following:

The following describes the equitable partition that the hypergraph regularity lemma will induce. The <math> (\mu, \delta, \mathbf{d}, r) </math>-equitable family of partition is a sequence of partitions of 1-edges (vertices), 2-edges (pairs), 3-edges (triples), etc.

====* <math> \mathcal{P}^{(1)} = \mu,{V_i \delta,colon i \mathbf{d},in r)[a_1]\} </math>- is equitable vertex partition ====of <math> V </math>. That is <math> |V_1| \leq \ldots \leq |V_{a_1}| \leq | V_1| + 1 </math> .

Let* <math> \mu > 0mathcal{P}^{(j)} </math> be a real number,partitions <math> r \geq mathcal{K}_j(\mathcal{G}^{(1 </math> be an integer, and <math> \delta)}) = K_{a_1}^{(\delta_2j)}(V_1, \ldots, \delta_V_{k-1a_1}) </math>, so that if <math> \mathbfP_1^{d}=(d_2j-1)}, \ldots, d_P_j^{k(j-1)} \in \mathcal{P}^{(j-1)} </math> be vectors of positive reals. Letand <math> \mathbfmathcal{aK} = _j(a_1, \ldots, a_cup_{ki=1}^jP_i^{(j-1)}) </math>\neq be a vector of positive integers and <math> V\emptyset </math> be an <math> n </math>-element vertex set. We say that a family of partitionsthen <math> \mathcal{P} = \mathcal{PK}_j(k-1, \mathbfcup_{a}) i= \{\mathcal{P1}^{(1)}\, \ldots, \mathcal{P}jP_i^{(kj-1)}\}) </math> onis partitioned into at most <math> Va_j </math> isparts, all of which are members <math> (\mu, \delta, \mathbfmathcal{dP}, r^{(j)} </math>-equitable if it satisfies the following.

* For all but at most <math> \mu n^k </math> <math> k </math>-tuples <math> K \in \binom{V}{k} </math> there is unique <math> (\delta, \mathbf{d},r) </math>-regular <math> (k, k-1) </math>-complex <math> \mathbf{P} = \{P^{(j)}\}_{j=1}^{k-1} </math> such that <math> P^{(j)} </math> has as members <math> \binom{k}{j} </math> different partition classes from <math> \mathcal{P}^{(j)} </math> and <math> K \in \mathcal{K}_k(P^{(k-1)}) \subset \ldots \subset \mathcal{K}_k(P^{(1)}) </math>.</blockquote>Finally, the following defines what it means for a <math> k </math>-uniform hypergraph to be regular with respect to a partition. In particular, this is the main definition that describes the output of hypergraph regularity lemma below.<blockquote>'''Definition [Regularity with respect to a partition].''' We say that a <math> k </math>-graph <math> \mathcal{H}^{(k)} </math> is <math> (\delta_k, r) </math>-regular with respect to a family of partitions <math> \mathcal{P} </math> if all but at most <math> \delta_k n^k </math> <math> k- </math>edges <math> K </math> of <math> \mathcal{H}^{(k)} </math> have the property that <math> K \in \mathcal{K}_k(\mathcal{G}^{(1)}) </math> and if <math> \mathbf{P} = \{P^{(j)}\}_{j=1}^{k-1} </math> is unique <math> (k, k-1) </math>-complex for which <math> K \in \mathcal{K}_k(P^{(k-1)}) </math>, then <math> \mathcal{H}^{(k)} </math> is <math> (\delta_k, d(\mathcal{H}^{(k)} \vert P^{(k-1)}), r) </math> regular with respect to <math> \mathcal{P} </math>.</blockquote>

* <math> \mathcal{P}^{(1)} = \{V_i \colon i \in [a_1]\} </math> is equitable vertex partition of <math> V </math>. That is <math> |V_1| \leq \ldots \leq |V_{a_1}| \leq | V_1| + 1 </math>

* <math> \mathcal{P}^{(j)} </math> partitions <math> \mathcal{K}_j(\mathcal{G}^{(1)}) = K_{a_1}^{(j)}(V_1, \ldots, V_{a_1}) </math> so that if <math> P_1^{(j-1)}, \ldots, P_j^{(j-1)} \in \mathcal{P}^{(j-1)} </math> and <math> \mathcal{K}_j(\cup_{i=1}^jP_i{(j-1)}) \neq \emptyset </math> then <math> \mathcal{K}_j(\cup_{i=1}^jP_i{(j-1)}) </math> is partitioned into at most <math> a_j </math> parts, all of which are members <math> \mathcal{P}^{(j)} </math>

* For all but at most <math> \mu n^k </math> <math> k </math>-tuples <math> K \in \binom{V}{k} </math> there is unique <math> (\delta, \mathbf{d},r) </math>-regular <math> (k, k-1) </math>-complex <math> \mathbf{P} = \{P^{(j)}\}_{j=1}^{k-1} </math> such that <math> P^{(j)} </math> has as members <math> \binom{k}{j} </math> different partition classes from <math> \mathcal{P}^{(j)} </math> and <math> K \in \mathcal{K}_k(P^{(k-1)}) \subset \ldots \subset \mathcal{K}_k(P^{(1)}) </math>

We say that a <math> k </math>-graph <math> \mathcal{H}^{(k)} </math> is <math> (\delta_k, r) </math>-regular with respect to a family of partitions <math> \mathcal{P} </math> if all but at most <math> \delta_k n^k </math> <math> k- </math>edges <math> K </math> of <math> \mathcal{H}^{(k)} </math> have the property that <math> K \in \mathcal{K}_k(\mathcal{G}^{(1)}) </math> and if <math> \mathbf{P} = \{P^{(j)}\}_{j=1}^{k-1} </math> is unique <math> (k, k-1) </math>-complex for which <math> K \in \mathcal{K}_k(P^{(k-1)}) </math>, then <math> \mathcal{H}^{(k)} </math> is <math> (\delta_k, d(\mathcal{H}^{(k)} \vert P^{(k-1)}), r) </math> regular with respect to <math> \mathcal{P} </math>.

== Statements ==

=== Hypergraph regularity lemma ===

For all positive real <math> \mu </math>, <math> \delta_k </math>, and functions <math> r \, \colon \mathbb{N} \times (0, 1]^{k-2} \to \mathbb{N} </math>, <math>\delta_j \, \colon (0,1]^{k-j} \to (0,1]</math> for <math> j = 2, \ldots, k-1 </math>, there exists <math> T_0 </math> and <math> rn_0 </math> so that the following holds. For any <math> k </math>-uniform hypergraph <math> \colonmathcal{H}^{(k)} </math> on <math> n \mathbbgeq n_0 </math> vertices, there exists a family of partitions <math> \mathcal{NP} = \timesmathcal{P}(k-1, \mathbf{a}) </math> and a vector <math> \mathbf{d} = (0d_2, \ldots, d_{k-1]^}) </math> so that, for <math> r = r(a_1, \mathbf{d}) </math> and <math> \mathbf{\delta} = (\delta_2, \ldots, \delta_{k-21}) </math> where <math> \todelta_j = \mathbbdelta_j(d_j, \ldots, d_{Nk-1}) </math> for all <math> j </math>, the following holds.

* <math> \mathcal{P} </math> is a <math> (\mu, \mathbf{\delta}, \mathbf{d}, r) </math>-equitable family of partitions and <math> a_i \leq T_0 </math> for every <math> i = 1, \ldots, k-1 </math>.

* <math> \mathcal{H}^{(k)} </math> is <math> (\delta_k, r) </math> regular with respect to <math> \mathcal{P} </math>.

there exists <math> T_0 </math> and <math> n_0 </math> so that the following holds. For any <math> k </math>-uniform hypergraph <math> \mathcal{H}^{(k)} </math> on <math> n \geq n_0 </math> vertices, there exists a family of partitions <math> \mathcal{P} = \mathcal{P}(k-1, \mathbf{a}) </math> and a vector <math> \mathbf{d} = (d_2, \ldots, d_{k-1}) </math> so that, for <math> \mathbf{\delta} = (\delta_2, \ldots, \delta_{k-1}) </math> where <math> \delta_j = \delta_j(d_j, \ldots, d_{k-1}) </math> for all <math> j </math>, and <math> r = r(a_1, \mathbf{d}) </math>, the following holds

\begin{enumerate}

* <math> \mathcal{P} </math> is a <math> (\mu, \mathbf{\delta}, \mathbf{d}, r) </math>-equitable family of partitions and <math> a_i \leq T_0 </math> for every <math> i = 1, \ldots, k-1 </math>

* <math> \mathcal{H}^{(k)} </math> is <math> (\delta_k, r) </math> regular with respect to <math> \mathcal{P} </math>

=== Hypergraph counting lemma ===

For all integers <math> 2 \leq k \leq l </math> the following holds: <math> \forall \gamma > 0 \; \; \forall d_k > 0 \; \; \exists \delta_k > 0 \;\; \forall d_{k-1} > 0 \; \; \exists \delta_{k-1} > 0 \; \cdots \; \forall d_2 > 0 \; \; \exists \delta_2>0 </math> and there are integers <math> r </math> and <math> m_0 </math> so that, with <math> \mathbf{d} = (d_2, \ldots, d_k) </math>, <math> \delta = (\delta_2, \ldots, \delta_k) </math>, and <math> m \geq m_0 </math>,

For all integers <math> 2 \leq k \leq l </math> the following holds:

<math> \forall \gamma > 0 \; \; \forall d_k > 0 \; \; \exists \delta_k > 0 \;\; \forall d_{k-1} > 0 \; \; \exists \delta_{k-1} > 0 \; \cdots \; \forall d_2 > 0 \; \; \exists \delta_2>0 </math> and there are integers <math> r </math> and <math> m_0 </math> so that, with <math> \mathbf{d} = (d_2, \ldots, d_k) </math>, <math> \delta = (\delta_2, \ldots, \delta_k) </math>, and <math> m \geq m_0 </math>,

if <math> \mathbf{G} = \{ \mathcal{G}^{(j)}\}_{j=1}^k </math> is a <math> (\delta, \mathbf{d}, r) </math>-regular <math> (l,k) </math> complex with wertexvertex partition <math> \mathcal{G}^{(1)} = V_1 \cup \cdots \cup V_l </math> and <math> |V_i| = m </math>, then

<math>\left|\mathcal{K}_l(\mathcal{G}^{(k)})\right| = (1 \pm \gamma) \prod_{h = 2}^kd_h^{\binom{l}{h}}\times m^l</math>.

== Applications ==

The main application through which most others follow is the [[hypergraph removal lemma]], which roughly states that given fixed <math> \mathcal{F}^{(k)} </math> and large <math> \mathcal{H}^{(k)} </math> <math> k </math>-uniform hypergraphs, if <math> \mathcal{H}^{(k)} </math> contains few copies of <math> \mathcal{F}^{(k)} </math>, then one can delete few hyperedges in <math> \mathcal{H}^{(k)} </math> to eliminate all of the copies of <math> \mathcal{F}^{(k)} </math>. To state it more formally,

\begin{theorem}=== [[Hypergraph removal lemma]] ===

<blockquote>For all <math> l \geq k \geq 2 </math> and every <math> \mu > 0 </math>, there exists <math> \zeta > 0 </math> and <math> n_0 > 0 </math> so that the following holds. Suppose <math> \mathcal{F}^{(k)} </math> is a <math> k </math>-uniform hypergraph on <math> l </math> vertices and <math> \mathcal{H}^{(k)} </math> is that on <math> n \geq n_0 </math> vertices. If <math> \mathcal{H}^{(k)} </math> contains at most <math> \zeta n^l </math> copies of <math> \mathcal{F}^{(k)} </math>, then one can delete <math> \mu n^k </math> hyperedges in <math> \mathcal{H}^{(k)} </math> to make it <math> \mathcal{F}^{(k)} </math>-free. </blockquote>One of the original motivations for graph regularity method was to prove [[Szemerédi's theorem]], which states that every dense subset of <math> \mathbb{Z} </math> contains an arithmetic progression of arbitrary length. In fact, by a relatively simple application of [[triangle removal lemma|the triangle removal lemma]], one can prove that every dense subset of <math> \mathbb{Z} </math> contains an arithmetic progression of length 3.

The hypergraph regularity method and hypergraph removal lemma can prove high-dimensional and ring analogues of density version of Szemerédi's theorems, originally proved by Furstenberg and Katznelson.<ref name=":0">{{Cite journal|last1=Furstenberg|first1=Hillel|last2=Katznelson|first2=Yitzhak|date=1978|title=An ergodic Szemeredi theorem for commuting transformations|journal=[[Journal d'Analyse Mathématique]]|volume=34|pages=275–291|doi=10.1007/BF02790016|doi-access=}}</ref> In fact, this approach yields first quantitative bounds for the theorems.

\begin{theorem}[Hypergraph removal lemma]

For all <math> l \geq k \geq 2 </math> and every <math> \mu > 0 </math>, there exists <math> \zeta > 0 </math> and <math> n_0 > 0 </math> so that the following holds. Suppose <math> \mathcal{F}^{(k)} </math> is a <math> k </math>-uniform hypergraph on <math> l </math> vertices and <math> \mathcal{H}^{(k)} </math> is that on <math> n \geq n_0 </math> vertices. If <math> \mathcal{H}^{(k)} </math> contains at most <math> \zeta n </math> copies of <math> \mathcal{F}^{(k)} </math>, then one can delete <math> \mu n^k </math> hyperedges in <math> \mathcal{H}^{(k)} </math> to make it <math> \mathcal{F}^{(k)} </math>-free.

\end{theorem}

One of the original motivations for graph regularity method was to prove a Szemerédi'sThis theorem, whichroughly statesimplies that everyany dense subset of <math> \mathbb{Z}^d </math> contains anany arithmeticfinite progressionpattern of arbitrary<math> length\mathbb{Z}^d </math>. InThe fact,case bywhen a<math> relativelyd simple= application1 of</math> triangleand removalthe lemma,pattern oneis canarithmetic proveprogression thatof everylength densesome subsetlength ofis equivalent <math>to \mathbb{Z}Szemerédi's theorem.</mathblockquote> contains an arithmetic progression of length 3.

\begin{theorem}[==== Furstenberg and Katznelson] Theorem ====

Source:<ref name=":0" />

Let <math> T </math> be a finite subset of <math> \mathbb{R}^d </math> and let <math> \delta > 0 </math> be given. Then there exists a finite subset <math> C \subset \mathbb{R}^d </math> such that allevery <math> Z \subset C </math> with <math> |Z| > \delta |C| </math> contains a homothetic copy of <math> T </math>. (i.e. set of form <math> z + \lambda T </math>, for some <math> z \in \mathbb{R}^d </math> and <math> t \in \mathbb{R} </math>)

Moreover, if <math> T \subset [-t; t]^d </math> for some <math> t \in \mathbb{N} </math>, then there exists <math> N_0 \in \mathbb{N} </math> such that <math> C = [-N,N]^d </math> has this property for all <math> N \geq N_0 </math>.</blockquote>Another possible generalization that can be proven by the removal lemma is when the dimension is allowed to grow.<blockquote>

The hypergraph regularity method and hypergraph removal lemma can prove high-dimensional and ring analogues of density version of Szemerédi's theorems, originally proved by Furstenberg and Katznelson. In fact, this approach yields first quantitative bounds for the theorems.

==== Tengan, Tokushige, Rödl, and Schacht Theorem ====

This theorem roughly implies that any dense subset of <math> \mathbb{Z}^d </math> contains any finite pattern of <math> \mathbb{Z}^d </math>. The case when <math> d = 1 </math> and the pattern is arithmetic progression of length some length is equivalent to Szemerédi's theorem.

\begin{theorem}[Furstenberg and Katznelson]

Let <math> T </math> be a finite subset of <math> \mathbb{R}^d </math> and let <math> \delta > 0 </math> be given. Then there exists a finite subset <math> C \subset \mathbb{R}^d </math> such that all <math> Z \subset C </math> with <math> |Z| > \delta |C| </math> contains a homothetic copy of <math> T </math>. (i.e. set of form <math> z + \lambda T </math>, for some <math> z \in \mathbb{R}^d </math> and <math> t \in \mathbb{R} </math>)

Moreover, if <math> T \subset [-t; t]^d </math> for some <math> t \in \mathbb{N} </math>, then there exists <math> N_0 \in \mathbb{N} </math> such that <math> C = [-N,N]^d </math> has this property for all <math> N \geq N_0 </math>.

\end{theorem}

Another possible generalization is when it is allowed the dimension to grow.

\begin{theorem}[Tengan, Tokushige, V.R., and M.S]

Let <math> A </math> be a finite ring. For every <math> \delta > 0 </math>, there exists <math> M_0 </math> such that, for <math> M \geq M_0 </math>, any subset <math> Z \subset A^M </math> with <math> |Z| > \delta |A^M| </math> contains a coset of an isomorphic copy of <math> A </math> (as a left <math> A </math>-module).

In other words, there are some <math> \mathbf{r}, \mathbf{u} \in A^M </math> such that <math> r + \varphi(A) \subset Z </math>, where <math> \varphi \colon A \to A^M </math>, <math> \varphi(a)=a \mathbf{u} </math> is an injection.

\end{theorem}

</blockquote>

== References ==

<!-- Inline citations added to your article will automatically display here. See en.wikipedia.org/wiki/WP:REFB for instructions on how to add citations. -->

{{reflist}}

[[Category:Graph theory]]