Zarankiewicz function
Zarankiewicz function proper noun: 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).
Proper noun
the Zarankiewicz function
- 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).
Questions about Zarankiewicz function
- What does Zarankiewicz function mean?
- Zarankiewicz function means 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).
- What part of speech is Zarankiewicz function?
- Zarankiewicz function is a proper noun.
Words near Zarankiewicz function in the dictionary
Source and license
Adapted from Wiktionary: Zarankiewicz function (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Zarankiewicz function.” Word.ws, https://word.ws/zarankiewicz_function. Based on Wiktionary, CC BY-SA 4.0.
