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. The proof uses probabilistic methods. The revised version contains an additional lower bound on T. 6 pp. Ref. (Author)
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.