Word.ws English Dictionary

Zarankiewicz problem

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.

Proper noun

the Zarankiewicz problem

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

Origin of Zarankiewicz problem

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

Questions about Zarankiewicz problem

What does Zarankiewicz problem mean?
Zarankiewicz problem means 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.
What part of speech is Zarankiewicz problem?
Zarankiewicz problem is a proper noun.

Words near Zarankiewicz problem in the dictionary

  1. zaragozic acid
  2. zaragozic acids
  3. Zarah
  4. Zaramo
  5. Zarankiewicz function
  6. Zarankiewicz problem
  7. zarape
  8. zarapes
  9. Zarasai
  10. zaratan
  11. zaratans

Source and license

Adapted from Wiktionary: Zarankiewicz problem (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 problem.” Word.ws, https://word.ws/zarankiewicz_problem. Based on Wiktionary, CC BY-SA 4.0.