Construct · 1 fields · 1 citations

Ramsey's theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorics

the principle that any sufficiently large structure whose parts are colored with finitely many colors must contain a large uniformly colored substructure.

In combinatorics, Ramsey's theorem refers to the principle that any sufficiently large structure whose parts are colored with finitely many colors must contain a large uniformly colored substructure. This meaning comes from Ramsey (1930) in Proceedings of the London Mathematical Society.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Ramsey's theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

must2 fields · 2 citationsjingle · one word, two constructs structure4 fields · 5 citationsjingle · one word, four constructs

References

Ramsey, F. P. (1930). On a Problem of Formal Logic. Proceedings of the London Mathematical Society, s2-30(1), 264-286. https://doi.org/10.1112/plms/s2-30.1.264

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct