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) =3 and f->[infinity]

Keevash, Peter

Caltech Authors

English

A new generalization of the Erd}os-Ko-Rado theorem,

A. F. Sidorenko, Extremal combinatorial problems in spaces with continuous measure, Issled. Operatsi˘ıi ASU 34 (1989), 34{40.

A. F. Sidorenko, Systems of sets that have the T -property, Vestnik Moskov. Univ. Ser. I Mat. Mekh. 1981, 19{22.

A. F. Sidorenko, What we know and what we do not know about Turan numbers, Graphs Combin. 11 (1995), 179{199.

An analytic approach to extremal problems for graphs and hypergraphs, Extremal problems for  sets (Visegrad,

An upper bound for the Turan number t (n, 4),

Asymptotic solution of a Turan-type problem.

B. Bollobas, Combinatorics, Set systems, hypergraphs, families of vectors and combinatorial probability, Cambridge University Press, Cambridge, 1986.

Combinatorics, Set systems, hypergraphs, families of vectors and combinatorial probability,

D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combin. 16 (1983), 5{10.

D. Mubayi and V. Ro¨dl, On the Turan number of Triple Systems, J. Comb. Theory Ser. A, 100 (2002), 136{152.

D. Mubayi, On hypergraphs with every four points spanning at most two triples, Electron. J. Combin. 10 (2003), Note 10, 4 pp. (electronic).

Extension of a theorem of Moon and Moser on complete subgraphs,

Extremal combinatorial problems in spaces with continuous measure,

F. Chung and L. Lu, An upper bound for the Turan number t (n, 4), J. Combin. Theory Ser. A 87 (1999), 381{389.

Intersection theorems for systems of sets,

On a hypergraph Turan problem of Frankl, Combinatorica,

On extremal problems of graphs and generalized graphs,

On hypergraphs with every four points spanning at most two triples,

On the structure of linear graphs,

On the Turan number of Triple Systems,

On triple systems with independent neighborhoods,

P. Erd}os and A. H. Stone, On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946), 1087{1091.

P. Erd}os and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 3 (1983), 181{192.

P. Erd}os and R. Rado, Intersection theorems for systems of sets, J. London Math. Soc. 35 1960, 85{90.

P. Erd}os, On extremal problems of graphs and generalized graphs, Israel J. Math. 2 (1964), 183{190.

P. Frankl, Asymptotic solution of a Turan-type problem. Graphs and Combinatorics 6 (1990), 223{227.

P. Frankl, Z. Fu¨redi, A new generalization of the Erd}os-Ko-Rado theorem, Combinatorica 3 (1983), 341{349.

P. Keevash and B. Sudakov, On a hypergraph Turan problem of Frankl, Combinatorica, to appear.

P. Keevash and B. Sudakov, The exact Turan number of the Fano plane, Combinatorica, to appear.

P. Keevash, The Turan problem for projective geometries, J. Combin. Theory Ser. A, to appear. the electronic journal of combinatorics 12 (2005), #N11 5

Supersaturated graphs and hypergraphs,

Systems of sets that have the T -property,

The exact Turan number of the Fano plane, Combinatorica,

The Turan problem for projective geometries,

Triple systems not containing a Fano Con

What we know and what we do not know about Turan numbers,

Z. Fu¨redi and M. Simonovits, Triple systems not containing a Fano Con Combin. Probab. Comput., to appear.

Z. Fu¨redi, O. Pikhurko and M. Simonovits, On triple systems with independent neighborhoods, Combin. Probab. Comput., to appear.

The Turán problem for hypergraphs of fixed size