Upper bounds for Turán numbers (Q5961541)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper bounds for Turán numbers |
scientific article; zbMATH DE number 981645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds for Turán numbers |
scientific article; zbMATH DE number 981645 |
Statements
Upper bounds for Turán numbers (English)
0 references
26 October 1997
0 references
The Turán number \(T(n,k,r)\) is the minimum size of a system of \(r\)-subsets of an \(n\)-set such that every \(k\)-subset contains at least one of the members of the system. The paper gives asymptotic upper bounds for these numbers. Constructive upper bounds in case that \(k=2r+1\) have been given by \textit{D. de Caen} et al. [Congr. Numerantium 65, 277-280 (1988; Zbl 0671.05003)].
0 references
set system
0 references
Turán number
0 references
upper bounds
0 references
0.8733341097831726
0 references
0.8686911463737488
0 references
0.8683871030807495
0 references
