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).

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper nounthe Zarankiewicz function
  1. graph theoryThe 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).
Cite this entry
APA

Zarankiewicz function. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Zarankiewicz%20function

MLA

“Zarankiewicz function.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Zarankiewicz%20function. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Zarankiewicz function,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Zarankiewicz%20function.

Source: Zarankiewicz function on Wiktionary, CC BY-SA 4.0.