Let T(n, k, b) (T for Turan) denote the smallest q such that there exists a k-graph with n vertices, q edges, and no independent set of size b. Improved lower bounds are found for the function T.
['Joel Spencer']
Turán's theorem for k-graphs