Zarankiewicz problem

Hello, you have come here looking for the meaning of the word Zarankiewicz problem. In DICTIOUS you will not only get to know all the dictionary meanings for the word Zarankiewicz problem, but we will also tell you about its etymology, its characteristics and you will know how to say Zarankiewicz problem in singular and plural. Everything you need to know about the word Zarankiewicz problem you have here. The definition of the word Zarankiewicz problem will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofZarankiewicz problem, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

English Wikipedia has an article on:
Wikipedia

Etymology

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

Proper noun

the Zarankiewicz problem

  1. (graph theory) 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.