Definitions from Wiktionary (Ramsey's theorem)

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


▸ Words similar to ramsey's theorem
▸ Usage examples for ramsey's theorem

▸ Idioms related to ramsey's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near ramsey's theorem
▸ Rhymes of ramsey's theorem

▸ Invented words related to ramsey's theorem