Turán number

• abstract: In mathematics, the Turán number T(n,k,r) for r-uniform hypergraphs of order n is the smallest number of r-edges such that every induced subgraph on k vertices contains an edge. This number was determined for r = 2 by , and the problem for general r was introduced in .

以上来源于: WordNet