In mathematics, the Turán number T ( n , k , r ) {\displaystyle T(n,k,r)} for r {\displaystyle r} -uniform hypergraphs of order n {\displaystyle n} is the smallest number of r {\displaystyle r} -edges such that every induced subgraph on k {\displaystyle k} vertices contains an edge. This number was determined for r = 2 {\displaystyle r=2} by Turán (1941), and the problem for general r {\displaystyle r} was introduced in Turán (1961).
In mathematics, the Turán number T ( n , k , r ) {\displaystyle T(n,k,r)} for r {\displaystyle r} -uniform hypergraphs of order n {\displaystyle n} is the smallest number of r {\displaystyle r} -edges such that every induced subgraph on k {\displaystyle k} vertices contains an edge. This number was determined for r = 2 {\displaystyle r=2} by Turán (1941), and the problem for general r {\displaystyle r} was introduced in Turán (1961).
Source: Wikipedia "Turán number" · CC BY-SA 4.0
Share this article: X · Bluesky