Hypergraph regularity method: Difference between revisions

Revision as of 10:03, 13 February 2022

Revision as of 22:03, 30 April 2022

Line 1:

{{AFC submission|d|reason|Lede needs to explain what this is in laymans' terms.|u=Lepsvera|ns=118|decliner=Stuartyeates|declinets=20220430220359|ts=20220129063043}} <!-- Do not remove this line! -->

{{AfC submission|||ts=20220129063043|u=Lepsvera|ns=118}}

<!-- Important, do not remove this line before article has been created. -->

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.