Ramsey's theorem

English dictionary entry

Meanings

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

Word forms

Ramsey's theorem Ramsey's theorems

Etymology

Named after British mathematician and philosopher Frank P. Ramsey.

Synonyms

finite Ramsey's theorem infinite Ramsey's theorem
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.