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
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 93Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:KEEejc05
Abstract
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].
| Item Type: | Article |
|---|---|
| Additional Information: | Submitted: October 22, 2004; Accepted: June 3, 2005; Published: June 14, 2005 |
| Record Number: | CaltechAUTHORS:KEEejc05 |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:KEEejc05 |
| Alternative URL: | http://www.combinatorics.org/Volume_12/Abstracts/v12i1n11.html |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 1140 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 22 Dec 2005 |
| Last Modified: | 26 Dec 2012 08:42 |
Repository Staff Only: item control page
