Ramsey's theorem

短语

词形变化

Ramsey's theorems 复数 Ramsey's theorems

释义与例句

n.
  1. 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.

    可数 不可数 数学
  2. 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.

    可数 不可数 数学

词源

Named after British mathematician and philosopher Frank P. Ramsey.

来源：wiktionary