Zarankiewicz problem

English

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.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.