Zarankiewicz problem

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

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

Proper noun[edit]

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.

Related terms[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=Zarankiewicz_problem&oldid=77974615"