Let T(n, k, b) (T for Turán) 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.
|Original language||English (US)|
|Number of pages||4|
|State||Published - May 1972|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics