最終更新日：2024/08/05

The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.

正解を見る

Ramsey's theorem

問題を編集する

元となった辞書の項目

Ramsey's theorem

noun

The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.

Ramsey's theorem is a fundamental result in combinatorial mathematics.

意味（1）

The theorem that any graph labelling (with colours) of a sufficiently large complete graph contains monochromatic cliques.

意味（2）