Meaning of Ramsey's theorem | Babel Free

Definitions

1. A (version of a) theorem concerning the existence of cliques in a labelled complete graph.
   countable, uncountable
2. The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.
   countable, uncountable
3. The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.
   countable, uncountable

CEFR level