Meanings
nounRamsey's theorem (countable and uncountable, plural Ramsey's theorems)
plural Ramsey's theorems
- A (version of a) theorem concerning the existence of cliques in a labelled complete graph.
- countableuncountablemathematicsThe theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.
- countableuncountablemathematicsThe theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.
Synonyms & antonyms
finite version of theorem
Similar
finite Ramsey's theorem
infinite version of theorem
Similar
infinite Ramsey's theorem
Origin
Named after British mathematician and philosopher Frank P. Ramsey.
Full word history & related roots →Cite this entry
APA
Ramsey's theorem. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Ramsey's%20theorem
MLA
“Ramsey's theorem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Ramsey's%20theorem. Accessed November 4, 2026.
Chicago
WatkinsX Dictionary, s.v. “Ramsey's theorem,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Ramsey's%20theorem.
Source: Ramsey's theorem on Wiktionary, CC BY-SA 4.0.