Last Updated
：2025/12/07
Zarankiewicz function
Proper noun
Japanese Meaning
双部グラフ G = (U, V, E) において、|U| = m, |V| = n となる頂点集合を持ち、部分グラフとして完全双部グラフ K_(s,t) を含まないという制約の下で構築可能な最大辺数を与える関数。
（ canonical ）
Quizzes for review
(graph theory) The function for which the Zarankiewicz problem seeks a formula: z(m, n; s, t), denoting the largest possible number of edges in a bipartite graph G = (U, V, E) for which |U| = m and |V| = n, but which does not contain a subgraph of the form K_(s,t).
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Zarankiewicz function
Recent progress on the Zarankiewicz function has shed light on extremal bipartite graphs that avoid large complete subgraphs.
See correct answer
Recent progress on the Zarankiewicz function has shed light on extremal bipartite graphs that avoid large complete subgraphs.
音声機能が動作しない場合はこちらをご確認ください
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
