Ramsey's theorem noun3 •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. formsRamsey's theorems
