Zarankiewicz problem

proper noun

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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper nounthe Zarankiewicz problem
  1. graph theoryAn 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.

Origin

Named after the Polish mathematician Kazimierz Zarankiewicz, who proposed several special cases of the problem in 1951.

Full word history & related roots →
Cite this entry
APA

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

MLA

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

Chicago

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

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