Last Updated
：2025/12/03
Turán's theorem
Proper noun
Japanese Meaning
グラフ理論における定理であり、n頂点の単純グラフのうち、（r＋1）クリークを含まないものの中で、T(n, r)が最大の辺数を持つことを示す定理です。
Quizzes for review
(graph theory) A theorem stating that, among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Turán's theorem
In our combinatorics seminar, we discussed Turán's theorem and how its extremal construction avoids (r + 1)-cliques.
See correct answer
In our combinatorics seminar, we discussed Turán's theorem and how its extremal construction avoids (r + 1)-cliques.
音声機能が動作しない場合はこちらをご確認ください
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
