Math 2.0

Combinatorics Ramsey theory Concept

Ramsey theory

Summary

Ramsey theory studies the statements that every large enough structure, divided into finitely many parts, has a part that contains a given regular substructure. Its founding result is Ramsey's theorem on monochromatic cliques in coloured complete graphs, with the Ramsey numbers as its quantitative side. In the integers it includes Schur's theorem, van der Waerden's theorem and Rado's theorem, and the abstract Hales–Jewett theorem contains many of these. Density versions, such as Szemerédi's theorem, link it to additive combinatorics and ergodic theory.

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ramsey_theory
About this page
TagG5TWXV565S
URIm2://G5TWXV565S
Kindconcept
WritingW0 stub
MSC05D10, 05C55
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • 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.

What links here

Results about this

Used by