Ramsey's theorem en · NOUN
Etymology
Named after British mathematician and philosopher Frank P. Ramsey.
Meanings
- (countable, uncountable) A (version of a) theorem concerning the existence of cliques in a labelled complete graph. ▸ The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.
- (countable, uncountable) A (version of a) theorem concerning the existence of cliques in a labelled complete graph. ▸ The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.
Forms
| Spelling | Features | Labels | Source |
|---|---|---|---|
| Ramsey's theorems | Number=Plur | lexicographic |
Synonyms
finite Ramsey's theorem (finite version of theorem) · infinite Ramsey's theorem (infinite version of theorem)