Word.ws English Dictionary

Ramsey's theorem

Ramsey's theorem noun: the theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.

Noun

Ramsey's theorem (countable and uncountable, plural Ramsey's theorems)

  1. The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.
  2. The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.

Synonyms of Ramsey's theorem

  • finite Ramsey's theorem
  • infinite Ramsey's theorem

Forms of Ramsey's theorem

pluralRamsey's theorems

Origin of Ramsey's theorem

Named after British mathematician and philosopher Frank P. Ramsey.

Questions about Ramsey's theorem

What does Ramsey's theorem mean?
Ramsey's theorem means the theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.
What part of speech is Ramsey's theorem?
Ramsey's theorem is a noun.
What is the plural of Ramsey's theorem?
The plural of Ramsey's theorem is Ramsey's theorems.

Words near Ramsey's theorem in the dictionary

  1. Ramsey number
  2. Ramsey numbers
  3. Ramsey sentence
  4. Ramsey sentences
  5. Ramsey theory
  6. Ramsey's theorem
  7. Ramsey's theorems
  8. Ramseyan
  9. Ramseyer
  10. Ramseyers
  11. Ramsgate

Source and license

Adapted from Wiktionary: Ramsey's theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Ramsey's theorem.” Word.ws, https://word.ws/ramsey%27s_theorem. Based on Wiktionary, CC BY-SA 4.0.