Quizzes for review
She presented Ramsey's theorem with vivid diagrams to demonstrate that sufficiently large complete graphs, when their edges are colored, must contain monochromatic cliques.
See correct answer
She presented Ramsey's theorem with vivid diagrams to demonstrate that sufficiently large complete graphs, when their edges are colored, must contain monochromatic cliques.
音声機能が動作しない場合はこちらをご確認ください
Related words
Ramsey's theorem
Noun
countable
uncountable
Japanese Meaning
充分に大きな完全グラフにおいて、頂点または辺に色などのラベリング（着色）を施すと、必ず単一の色で構成されたクリーク（完全部分グラフ）が存在するという定理
Related Words
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
