Ramsey's theorem
Meanings
noun
- 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.
- The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique.
Word forms
Etymology
Named after British mathematician and philosopher Frank P. Ramsey.
Synonyms
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.