Denote by T(n, k, b)--T for Turan--the smallest q such that there exists a k-graph with n vertices, q edges, and with no independent set of size b. The calculation for k = 2 is Turan's theorem. An improved lower bound on T is given in this paper. ...
