Keevash, Peter (2005) The Turán problem for hypergraphs of fixed size. Electronic Journal of Combinatorics, 12 (1). N11. ISSN 1077-8926 http://resolver.caltech.edu/CaltechAUTHORS:KEEejc05
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:KEEejc05
We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that it contains. If F is an r-uniform hypergraph with f edges we show that [pi](F) < [f−2]/[f−1] −(1+o(1))(2r!2=rf3−2=r)^−1, for fixed r>=3 and f->[infinity].
|Additional Information:||Submitted: October 22, 2004; Accepted: June 3, 2005; Published: June 14, 2005|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||22 Dec 2005|
|Last Modified:||26 Dec 2012 08:42|
Repository Staff Only: item control page