Ramsey's theorems
Ramsey's theorems is the plural of Ramsey's theorem.
Meaning of Ramsey's theorem
Noun
Ramsey's theorem (countable and uncountable, plural Ramsey's theorems)
- The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.
- The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.
Questions about Ramsey's theorems
- What is Ramsey's theorems the plural of?
- Ramsey's theorems is the plural of Ramsey's theorem.
Words near Ramsey's theorems in the dictionary
Source and license
Adapted from Wiktionary: Ramsey's theorems (page history and authors); 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 theorems.” Word.ws, https://word.ws/ramsey%27s_theorems. Based on Wiktionary, CC BY-SA 4.0.
