Last Updated
：2025/12/07
Zarankiewicz problem
Proper noun
Japanese Meaning
数学における未解決問題であり、指定された頂点数を持ち、かつ特定の大きさの完全二部グラフを含まない二部グラフにおいて、辺の最大数を求める問題です。
（ canonical ）
Quizzes for review
(graph theory) An unsolved problem in mathematics, asking for the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete bipartite subgraphs of a given size.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Zarankiewicz problem
While studying extremal graph theory, she devoted her thesis to the Zarankiewicz problem, hoping to edge closer to a general solution.
See correct answer
While studying extremal graph theory, she devoted her thesis to the Zarankiewicz problem, hoping to edge closer to a general solution.
音声機能が動作しない場合はこちらをご確認ください
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
