Extremal Problems on Set Systems

Random Structures and Algorithms

Volumn 20, Issue 2, 2002, Pages 131-164

  Frankl, Peter ^a   Rödl, Vojtěch ^b  

^a CNRS   (France)

^b EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242330685     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10017     Document Type: Article

References (15)

1. W.G. Brown, P. Erdó;s, and V.T. Sós, "Some extremal problem on r-graphs," New directions in the theory of graphs (Proc Third Ann Arbor Conf, Univ. Michigan, Ann Arbor, MI, 1971) Acadamic Press, New York, 1973, pp. 53-63.
2. D. de Caen, On Turán's hypergraph problem, Ph.D. thesis, University of Toronto, 1982.
3. P. Erdó;s, P. Frankl, and V. Rödl, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin 2(2) (1986), 113-121.
4. P. Erdó;s, On external problems of graphs and generalized graphs, Israel Math 2 (1964), 183-190.
5. P. Erdó;s and A.H. Stone, On the structure of linear graphs, Bull Amer Math Soc 52 (1946), 1087-1091.
6. P. Erdó;s and M. Simonovits, A limit theorem in graph theory, Studia Scientiarum Mathematicarum Hungarica 1 (1966), 51-57.
7. H. Furstenberg and Y. Katznelson, An ergodic Szemerédi theorem for IP-systems and combinatorial theory, J d' Analyse Mathématique 45 (1985), 117-168.
8. P. Frankl and V. Rödl, Lower bounds for Turán's problem, Graphs Combin 1(3) (1985), 213-216.
9. P. Frankl and V. Rödl, The uniformity lemma for hypergraphs, Graphs Combin 8(4) (1992), 309-312.
10. Z. Füredi, Turán type problems, Surveys in combinatorics, 1991 (Guildford, Cambridge 1991), London Mathematical Society Lecture Note Series 166, Cambridge University Press, Cambridge, 1991, pp. 253-300
11. A. Sidorenko, What we know and what we do not know about Turán numbers, Graphs Combin 11(2) (1995), 179-199.
12. A. Sidorenko, Upper bounds for Turán numbers, J Combin Theory Ser A 77(1) (1997), 134-147.
13. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica 27 (1975), 199-245. [Collection of articles in memory of Juriǐ Vladimirovič Linnik.]
14. E. Szemerédi, Regular partitions of graphs, Problèmes Combinatoires et Théorie des Graphes (Orsay), Colloques Internationaux CNRS 260, 1976, pp. 399-401.
15. P. Turán, Eine Extremalaufgabe aus der Graphentheorie, Mat Fiz Lapok 48 (1941), 436-452. (Hungarian, with German summary.)