Ramsey's theorem

名词 n.

英文释义

名词 n.
  1. 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. countable,uncountable
  2. A (version of a) theorem concerning the existence of cliques in a labelled complete graph.; The theorem that any graph labelling (with colours) of an infinite complete graph contains at least one infinite monochromatic clique. countable,uncountable

词形变化

Ramsey's theorems plural

词汇关系

近义词
finite Ramsey's theorem infinite Ramsey's theorem

词源

Named after British mathematician and philosopher Frank P. Ramsey.
0 次浏览 数据来源: Wiktionary