Hypergraph regularity method: Difference between revisions

Content deleted Content added
Lepsvera (talk | contribs)
No edit summary
Lepsvera (talk | contribs)
Line 1:
{{AfC submission|t||ts=20211127234938|u=Lepsvera|ns=118|demo=}}<!-- Important, do not remove this line before article has been created. -->
 
 
== 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.
Line 13 ⟶ 9:
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.
{{AfC submission|t||ts=20211127234938|u=Lepsvera|ns=118|demo=}}<!-- Important, do not remove this line before article has been created. -->
 
== Definitions ==
The following formulations are due to [insert names], for alternative versions see [insert names]. In order to state hypergraph regularity and counting lemmas formally, we need to define several rather technical terms to formalize appropriate notions of pseudo-randomness (random-likeness) and boundedness, as well as to describe the random-like blocks and partitions.