Zarankiewicz problem

短语

词形变化

the Zarankiewicz problem

释义与例句

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

    数学

词源

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

来源：wiktionary