HomeServicesBlogDictionariesContactSpanish Course
Home › Dictionary › English › Ramsey's theorem
← Back to search

Meaning of Ramsey's theorem | Babel Free

Noun CEFR B2

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

B2
Upper Intermediate
This word is part of the CEFR B2 vocabulary — upper intermediate level.
See all B2 English words →

See also

Ramseyer Ramsgate Ramsgate Beach Ramsgreave Ramshackle ramshackleness

Learn this word in context

See Ramsey's theorem used in real conversations inside our free language course.

Start Free Course

Know this word better than we do? Language is a living thing — help us keep it growing. Collaborate with Babel Free