No CrossRef data available.
Article contents
Constructive Upper Bounds for the Turán Number
Published online by Cambridge University Press: 01 December 1997
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
The Turán Number T(n, k, r) is the smallest possible number of edges in a k-graph of ordern such that every set of r vertices contains an edge. The limit
formula here
exists, but there is no pair (k, r) with r>k[ges ]3 for which this function could be determined as yet. We give a constructive proof of the upper bound
formula here
for every k and r with r[ges ]k[ges ]2. In the case k=6, r=11 we improve this result, refuting thereby a conjecture of Turán.
Information
- Type
- Research Article
- Information
- Copyright
- 1997 Cambridge University Press
You have
Access