—(mathematics) 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.—infinite version of theorem