Published June 14, 2005
| Published
Journal Article
Open
The Turán problem for hypergraphs of fixed size
- Creators
- Keevash, Peter
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].
Additional Information
© 2--5 The Author(s). Submitted: October 22, 2004; Accepted: June 3, 2005; Published: June 14, 2005.Attached Files
Published - KEEejc05.pdf
Files
KEEejc05.pdf
Files
(96.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a477a8f20bff53a7eb4b4aee79137d82
|
96.1 kB | Preview Download |
Additional details
- Eprint ID
- 1140
- Resolver ID
- CaltechAUTHORS:KEEejc05
- Created
-
2005-12-22Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field