A hypergraph extension of Turán's theorem

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 1, 2006, Pages 122-134

  Mubayi, Dhruv ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Extremal hypergraph problems; Stability; Tur n's theorem

Indexed keywords

EID: 29244436636     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2005.06.013     Document Type: Article

References (20)

1. N. Alon, J. Spencer, The probabilistic method, second ed., with an appendix on the life and work of Paul Erdos, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.
2. D. deCaen Z. Füredi The maximum size of 3-uniform hypergraphs not containing a Fano plane J. Combin. Theory Ser. B 78 2 2000 274-276
3. P. Erdos On extremal problems of graphs and generalized graphs Israel J. Math. 2 1964 183-190
4. P. Erdos, On the graph theorem of Turán, Mat. Lapok 21 (1970), 249-251 (1971, Hungarian).
5. P. Erdos M. Simonovits Supersaturated graphs and hypergraphs Combinatorica 3 2 1983 181-192
6. P. Frankl Asymptotic solution of a Turán-type problem Graphs Combin. 6 1990 223-227
7. Z. Füredi, Turán type problems, Surveys in Combinatorics, 1991, pp. 253-300; Guildford, 1991, London Mathematical Society, Lecture Note Series, vol. 166, Cambridge University Press, Cambridge, 1991.
8. Z. Füredi O. Pikhurko M. Simonovits The turan density of the hypergraph {abc, ade, bde, cde} Electron. J. Combin 10 2003 7
9. Z. Füredi, O. Pikhurko, M. Simonovits, On triple systems with independent neighborhoods, Comb. Prob. and Comput., to appear.
10. P. Frankl V. Rödl Hypergraphs do not jump Combinatorica 4 2-3 1984 149-159
11. Z. Füredi, M. Simonovits, Triple systems not containing a Fano configuration, Comb. Prob. and Comput. 14(4) (2005) 467-484.
12. P. Keevash D. Mubayi Stability results for cancellative hypergraphs J. Combin. Theory Ser. B 92 1 2004 163-175
13. P. Keevash, B. Sudakov, The exact Turán number of the Fano plane, Combinatorica, to appear.
14. P. Keevash, B. Sudakov, On a hypergraph Turán problem of Frankl, Combinatorica, to appear.
15. R.S. Li W.W. Li Independence numbers of graphs and generators of ideals Combinatorica 1 1 1981 55-61
16. T.S. Motzkin E.G. Straus Maxima for graphs and a new proof of a theorem of Turán Canad. J. Math. 17 1965 533-540
17. D. Mubayi V. Rödl On the Turán number of triple systems J. Combin. Theory Ser. A 100 2002 136-152
18. M. Simonovits, A method for solving extremal problems in graph theory, stability problems, theory of graphs, Proceedings of Colloquium, Tihany, 1966, Academic Press, New York, 1968, pp. 279-319.
19. P. Erdos, Some recent results on extremal problems in graph theory, in: Theory of Graphs, International Symposium, Rome, 1966, Gordon and Breach, New York, Dunod, Paris, 1967, pp.118-123.
20. P. Erdos On some new inequalities concerning extremal properties of graphs, in: Theory of Graphs, Proceedings of the Colloqium, Tihany, 1966, Academic Press, New York, 1968, pp. 77-81.