Math 2.0

Areas Extremal and probabilistic combinatorics Topic

The semi-random method and random processes

Summary

This topic is a part of extremal and probabilistic combinatorics. It covers the Rödl nibble, the differential equation method and random greedy processes, and their uses in packing and colouring.

About this page
TagME2TZGZH60
URIm2://ME2TZGZH60
Kindtopic
WritingW0 stub
MSC05D40, 05C80, 05C70
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.