Math 2.0

Areas Extremal and probabilistic combinatorics Topic

The regularity method

Summary

This topic is a part of extremal and probabilistic combinatorics. It covers Szemerédi's regularity lemma with its counting and removal lemmas, its stronger, weaker, sparse and hypergraph forms, and property testing.

About this page
TagEMN5HNH4PM
URIm2://EMN5HNH4PM
Kindtopic
WritingW0 stub
MSC05C35, 05D99
Part ofExtremal and probabilistic combinatorics
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.