Hypergraph regularity method: Difference between revisions

Revision as of 06:05, 28 December 2021

Revision as of 06:30, 29 January 2022

Line 1:

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

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

Hypergraph regularity method is a powerful tool in [[extremal graph theory]] 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 regularity lemma|Szemerédi's regularity]] and counting lemmas.