Ramsey-Turán theory

Discrete Mathematics

Volumn 229, Issue 1-3, 2001, Pages 293-340

  Simonovits, Miklós ^a   Sós, Vera T ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

Geometry; Graphs; Hypergraphs; Ramsey theory; Ramsey Tur n theorems; Tur n type extremal graph theory

Indexed keywords

EID: 0038701304     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00214-4     Document Type: Article

References (162)

1. M. Ajtai, P. Erdos, J. Komlós, E. Szemerédi, On Turán's theorem for sparse graphs, Combinatorica 1(4) (1981) 313-318. MR#83d:05052.
2. M. Ajtai, J. Komlós, J. Pintz, J. Spencer, E. Szemerédi, Extremal uncrowded hypergraphs, J. Combin. Theory A 32(3) (1982) 321-335. Math Reviews: 83i:05056.
3. M. Ajtai, J. Komlós, E. Szemerédi, A note on Ramsey numbers, J. Combin. Theory (A) 29 (1980) 354-360; MR82a:05064.
4. M. Ajtai, J. Komlós, E. Szemerédi, A dense infinite Sidon sequence, European J. Combin. 2 (1981) 1-11.
5. N. Alon, P. Erdos, An application of graph theory to additive number theory, European J. Combin. 6(3) (1985) 201-203. Math Reviews: 87d:11015; Zentralblatt: 581.10029.
6. A. Alon, L. Rónyai, T. Szabó, Norm-graphs: variations and applications, J. Combin. Theory Ser. B 76 (1999) 280-290.
7. B. Andrásfai, Über end Extremalprobleme, Acta Math. Hungar. 13 (1962) 443-455.
8. B. Andrásfai, Graphentheoretishe Extremalprobleme, Acta Math. Hungar. 15 (1964) 413-438.
9. n, intuitive geometry, Proceedings of the Colloquium Journal of Bolyai Mathematical Society, Budapest, Vol. 63, Szeged, Hungary, 1991, pp. 7-10.
10. J. Beck, Almost collinear triples among N points on the plane, in: A tribute to Paul Erdos, Cambridge University Press, Cambridge, 1990, pp. 39-57. Math Reviews:: 92h:52019.
11. C.T. Benson, Minimal regular graphs of girths eight and twelve, Canad. J. Math. 18 (1996) 1091-1094. MR33#5507.
12. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
13. B. Bollobás, An extension of the isoperimetric inequality on the sphere, Elem. Math. 44 (1989) 121-124.
14. B. Bollobás, P. Erdos, On a Ramsey-Turán type problem, J. Combin. Theory B 21 (1976) 166-168.
15. B. Bollobás, P. Erdos, G.P. Jin, Ramsey problems in additive number theory, Acta Arith. 64(4) (1993) 341-355. Math Reviews: 94g:11009; Zentralblatt: 789.11007.
16. B. Brandt, Dense graphs with bounded clique number, Habilitation Thesis, Freie University, Berlin, 2000.
17. W.G. Brown, On graphs that do not contain a Thomsen graph, Canad. Math. Bull. 9 (1996) 281-285. MR34#81.
18. W.G. Brown, On an open problem of Paul Turán concerning 3-graphs, Studies in Pure Math (dedicated to the memory of P. Turán), Akadémiai Kiadó, Budapest and Birkhäuser, Basel, 1983, pp. 91-93.
19. W.G. Brown, P. Erdos, M. Simonovits, Extremal problems for directed graphs, J. Combin. Theory B 15(1) (1973) 77-93; MR52#7952.
20. W.G. Brown, P. Erdos, M. Simonovits, Multigraph extremal problems I, preprint, 1975.
21. W.G. Brown, P. Erdos, M. Simonovits, Multigraph extremal problems II, preprint, 1975.
22. W.G. Brown, P. Erdos, M. Simonovits, On multigraph extremal problems in: J.-C. Bermond et al. (Eds.), Problemes Combinatoires et Theorie des Graphes, CRNS, Paris, 1978, pp. 63-66. MR81e:05005.
23. W.G. Brown, P. Erdos, M. Simonovits, Inverse extremal digraph problems, Proceedings of the Colloquium Mathematical Society, János Bolyai, Vol. 37, Finite and Infinite Sets, Eger, Hungary, 1981, Akad. Kiadó, Budapest, 1985, pp. 119-156.
24. W.G. Brown, P. Erdos, M. Simonovits, Algorithmic solution of extremal digraph problems, Trans. Amer. Math. Soc. 292 (2) (1985) 421-449.
25. W.G. Brown, P. Erdos, M. Simonovits, Asymptotical uniqueness of extremal digraphs and multigraphs, manuscript (2000).
26. W.G. Brown, F. Harary: Extremal digraphs, Combinatorial theory and its applications, Colloq. Math. Soc. J. Bolyai 4 (1970) I. 135-198; MR 45#8576.
27. S. Burr, P. Erdos, A Ramsey-type property in additive number theory, Glasgow Math. J. 27 (1985) 5-10; Math Reviews: 87b:11014; Zentralblatt:578.10055.
28. S. Burr, P. Erdos, L. Lovász, On graphs of Ramsey type, Ars Combin. 1 (1976) 167-190.
29. F.R.K. Chung, . . . on local Ramsey numbers, oral communication (see [52], p. 80).
30. F.R.K. Chung, Regularity lemmas for hypergraphs and quasi-randomness, Random Struct. Algorithms 2 (2) (1991) 241-252.
31. F.R.K. Chung, R.L. Graham, Quasi-random hypergraphs, Random Struct. Algorithms 1 (1990) 105-124.
32. F.R.K. Chung, R.L. Graham, R.M. Wilson, Quasi-random graphs, Combinatorica 9 (4) (1989) 345-362.
33. P. Erdos, On sequences of integers no one of which divides the product of two others and some related problems, Izvestiya Naustno-Issl. Inst. Mat. Meh. Tomsk 2 (1938) 74-82 (Mitteilungen des Forschungsinstitutes für Math, und Mechanik, Tomsk, in Zentralblatt 20, p. 5.)
34. P. Erdos, Elemente der Math. 10 (1955) 114.
35. P. Erdos, On set of n points, Amer. Math. Monthly 53 (1946) 248-250.
36. P. Erdos, Remark on a theorem of Ramsey, Bull. Res. Council Israel 7 (1957) 21-24.
37. P. Erdos, Graph theory and probability, II. Canad. J. Math. 13 (1961) 346-352.
38. P. Erdos, On extremal problems of graphs and generalized graphs, Israel J. Math. 2 (1964) 183-190. Math Reviews: 32#1134; Zentralblatt: 129,399.
39. P. Erdos, On the construction of certain graphs, J. Combin. Theory 1 (1966) 149-153.
40. P. Erdos, Some recent results on extremal problems in: graph theory, results, in: Theory of Graphs, International Symposium, Rome, 1966, pp. 117-123 (English), pp. 124-130 (French), Gordon and Breach, New York; Dunod, Paris, 1967. Math Reviews: 37#2634; Zentralblatt: 187,210 (reprinted in [44]).
41. P. Erdos, On some applications of graph theory to geometry, Canad. J. Math. 19 (1967) 968-971.
42. P. Erdos, On some new inequalities concerning extremal properties of graphs, in: P. Erdos, G. Katona (Eds.), Theory of Graphs, Proceedings of the Colloquium of Tihany, 1966, Academic Press, New York, 1968, pp. 77-81.
43. P. Erdos, On some extremal problems on r-graphs, Discrete Math. 1(1) (1971/72) 1-6. Math Reviews: 45#6656; Zentralblatt: 211,270.
44. J. Spencer (Ed.), Art of Counting, Selected Writings of Paul Erdos, MIT Press, Cambridge, MA, 1973.
45. P. Erdos, Some applications of Ramsey's theorem to additive number theory, European J. Combin. 1(1) (1980) 43-46. Math Reviews: 82a:10067; Zentralblatt: 442.10037.
46. P. Erdos, Problems and results on extremal problems in number theory, geometry, and combinatorics, Proceedings of the Seventh Fischland Colloquium, I, Wustrow, 1988; Rostock. Math. Kolloq. (38) (1989) 6-14. Math Reviews: 91d:05088; Zentralblatt: 718.11001.
47. P. Erdos, Problems and Results on graphs and hypergraphs, similarities and differences, in: J. Nešetřil, V. Rödl (Eds.), Mathematics of Ramsey Theory, Series: Algorithms Combinatorics, Vol. 5, Springer, Berlin, 1990, pp. 214-231.
48. P. Erdos, A. Hajnal, On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hungar. 17 (1966) 61-99.
49. P. Erdos, A. Hajnal, On Ramsey like theorems. Problems and results, Combinatorics, Proceedings of the Conferences on Combinatorial Mathematics, Mathematical Institute, Oxford, 1972, Institute of Mathematics Applications, Southend-on-Sea, 1972, pp. 123-140. Math Reviews: 49#2405; Zentralblatt: 469.05001.
50. P. Erdos, A. Hajnal, M. Simonovits, V.T. Sós, E. Szemerédi, Turán-Ramsey theorems and simple asymptotically extremal structures, Combinatorica 13 (1993) 31-56.
51. p-stability numbers, Combin. Probab. Comput. 3(3) (1994); in: Bollobás (Ed.), Paul Erdos Birthday Conference, 1993, Cambridge, pp. 297-325.
52. P. Erdos, A. Hajnal, V.T. Sós, E. Szemerédi, More results on Ramsey-Turán type problem, Combinatorica 3 (1) (1983) 69-82.
53. P. Erdos, F. Harary, W. Tutte, On the dimension of a graph, Mathematika 12 (1965) 118-122. Math Reviews: 32#5537; Zentralblatt: 151,332.
54. P. Erdos, A. Meir, V.T. Sós, P. Turán, On some applications of graph theory I, Discrete Math. 2(3) (1972) 207-228. Math Reviews: 46#5053; Zentralblatt: 236.05119.
55. P. Erdos, A. Meir, V.T. Sós, P. Turán, On some applications of graph theory II, Studies in Pure Mathematics (presented to R. Rado), Academic Press, London, 1971, pp. 89-99. Math Reviews: 44#3887; Zentralblatt: 218.52005.
56. P. Erdos, A. Meir, V.T. Sós, P. Turán, On some applications of graph theory III, Canadian Math. Bull. 15 (1972) 27-32.
57. P. Erdos, A. Meir, V.T. Sós, Turán, Corrigendum: 'On some applications of graph theory, I'. [Discrete Math. 2(3) (1972) 207-228], Discrete Math. 4 (1973) 90. Math Reviews: 46#7093; Zentralblatt: 245.05130.
58. P. Erdos, A. Meir, V.T. Sós, Turán, Corrigendum: 'On some applications of graph theory, I'. [Discrete Math. 2(3) (1972) 207-228], Discrete Math. 4 (1973) 90. Math Reviews: 46#7093; Zentralblatt: 245.05130.
59. P. Erdos, L. Moser, A problem of tournaments, Canad. Math. Bull. 7 (1964) 351-356.
60. P. Erdos, J. Nesetril, V. Rodl, On Pisier type problems and results (combinatorial applications to number theory), Mathematics of Ramsey theory, Algorithms Combinatorics, Vol. 5, Springer, Berlin, 1990, pp. 214-231. Zentralblatt: 727.11009.
61. P. Erdos, G. Purdy, Extremal problems in combinatorial geometry, in: R.L. Graham, M. Grotschel, L. Lovász (Eds.), Handbook of Combinatorics, Vols. 1,2, Elsevier Science BV, Amsterdam; MIT Press, Cambridge, MA, 1995, pp. 809-874.
62. P. Erdos, A. Rényi, V.T. Sós, On a problem of graph theory, Studia Sci. Acad. Math. Hungar. 1 (1966) 215-235. MR34 #6310 (reprinted in [44]).
63. P. Erdos, C.A. Rogers, The construction of certain graphs, Canadian J. Math. 14 (1962) 702-707 (reprinted in [44]).
64. P. Erdos, A. Sárkozy, V.T. Sós, On product representation of powers, I, European J. Combin. 16 (1995) 567-588.
65. P. Erdos, M. Simonovits, A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966) 51-57.
66. P. Erdos, M. Simonovits, On the chromatic number of Geometric graphs, Ars Combin. 9 (1980) 229-246. MR#82c:05048.
67. P. Erdos, V.T. Sós, Some remarks on Ramsey's and Turán's theorems, in: P. Erdos et al. (Eds.), Combinatorics Theory and Applications, Proceedings of the Colloquium on Mathematical Society János Bolyai 4, Balatonfüred, 1969, pp. 395-404. Math Reviews: 45#8560; Zentralblatt: 209,280.
68. P. Erdos, V.T. Sós, Problems and results on Ramsey-Turán type theorems (preliminary report), Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Humboldt State University, Arcata, CA, 1979, Congresses Numeration, Vol. XXVI, Utilitas Mathematics, Winnipeg, Man., 1980, pp. 17-23. Math Reviews: 82a:05055; Zentralblatt: 463.05050.
69. P. Erdos, V.T. Sós, On Turán-Ramsey type theorems, II, Studia Sci. Math. Hungar. 14 (1-3) (1979) 27-36, 1982, Math Reviews: 84j:05081; Zentralblatt: 487.05054.
70. P. Erdos, V.T. Sós, On Ramsey-Turán type theorems for hypergraphs, Combinatorica 2(3) (1982) 289-295. Math Reviews: 85d:05185; Zentralblatt: 511.05049.
71. P. Erdos, J. Spencer, Probability methods in combinatorics, Academic Press and Publishing House of Hungarian Academic Science, New York, 1974.
72. P. Erdos, A.H. Stone, On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946) 1089-1091.
73. P. Erdos, Gy. Szekeres, A Combinatorial problem in geometry, Compositio Math. 2 (1935) 463-4170.
74. L. Fejes Tóth, Regular Figures, International Series of Monographs on Pure and Applied Mathematics, Pergamon Press, London, 1964.
75. D.G. Fon-der-Flaass, On a construction method of (3,4)-graphs, Matem. Zametki 44 (4) (1988) 546-550.
76. P. Frankl, Z. Füredi, An exact result for 3-graphs, Discrete Math. 50 (1984) 323-328.
77. P. Frankl, V. Rodl, Some Ramsey-Turán type results for hypergraphs, Combinatorica 8 (4) (1988) 323-332.
78. P. Frankl, V. Rodl, R.M. Wilson, The number of submatrices of given type in an Hadamard matrix and related results, J. Combin. Theory B 44 (3) (1988) 317-328.
79. P. Frankl, R.M. Wilson, Intersection theorems with geometric consequences, Combinatorica 1 (4) (1981) 357-368.
80. Z. Füredi, Finite geometries and extremal graph theory, Ph.D. Thesis, 1981.
81. A. Galluccio, M. Simonovits, G. Simonyi, On the structure of co-critical graphs, in: Graph Theory, Combinatorics, and Algorithms, Vols. 1,2, Proceedings of the Conference Kalamazoo, MI, 1992, pp. 1053-1071.
82. A. Gyárfás, J. Lehel, R.H. Schelp, Zs. Tuza, Ramsey numbers for local colorings, Graphs Combin. 3 (3) (1987) 267-277.
83. A. Gyárfás, J. Lehel, J. Nešetřil, V. Rodl, R.H. Schelp, Local k-colorings of graphs and hypergraphs, 1987, J. Combin. Theory B 43 (2) (1987) 127-139.
84. G.M. Goluzin, Geometriceskaya teoriya funkcii kompleksnogo peremennogo [Geometrical theory of functions of a complex variable.] Gosudarstv. Izdat. Tehn.-Teor. Lit., Moscow-Leningrad, 1952, 540pp. (in Russian). Math Reviews: 15,112d
85. G.M. Goluzin, Geometric theory of functions of a complex variable (English translation). Translations of Mathematical Monographs, Vol. 26, American Mathematical Society, Providence, RI, 1969, vi+676 pp. Math Reviews: 40#308.
86. R.L. Graham, B.L. Rothschild, J. Spencer, Ramsey Theory, Wiley Interscience, Series in Discrete Mathematics, Wiley, New York, 1980, 2nd Edition: 1990.
87. J.E. Graver, J. Yackel, Some graph theoretic results associated with Ramsey's theorem, J. Combin. Theory 4 (1968) 125-175. [MR 37#1278].
88. 6-free bipartite graphs and product representation of squares, Discrete Math. 165-166 (1977) 371-375.
89. Gy. Katona, Gráfok, vektorok és valószínuségszámítási egyenlotlenségek, Mat. Lapok 20 (1-2) (1969) 123-127.
90. Gy. Katona, Inequalities for the distribution of the length of sum of random vectors, Teorija Verojatnost. i Primenenij 15 (1977) 466-481.
91. Gy. Katona, Continuous versions of some extremal hypergraph problems, Proceedings of the Colloquium Mathematical Society, János Bolyai, Vol. 18, Combinatorics, 1978, pp. 653-678.
92. Gy. Katona, Continuous versions of some extremal hypergraph problems, II. Acta Math. Acad. Sci. Hungar. 36 (1980) 67-77.
93. Gy. Katona, Sums of vectors and Turán's problem for 3-graphs, European J. Combin. 2 (1981) 145-154.
94. Gy. Katona, 'Best' inequalities for the distribution of the length of sums of two random vectors, Z. Warsch. Verw. Gebiete 60 (1982) 411-423.
95. G. Katona, Probabilistic inequalities from extremal graph results (a survey), Random Graphs '83, Poznan, 1983, Ann. Discrete Math. 28 (1985) 159-170.
96. Gy Katona, B.S. Stechkin, Combinatorial numbers, geometrical constants and probabilistic inequalities, Dokl. Akad. Nauk. SSSR 251 (1980) 1293-1296.
97. G. Katona, T. Nemetz, M. Simonovits, A new proof of a theorem of P. Turán and some remarks on a generalization of it, Mat. Lapok XV (1-3) (1964) 228-238 (in Hungarian).
98. 2/logt, Random Struct. Algorithms 7 (3) (1995) 173-207.
99. J. Komlós, J. Pintz, E. Szemerédi, On Heilbronn's triangle problem, J. London Math. Soc. (2)24 (3) (1981) 385-396.
100. J. Komlós, J. Pintz, E. Szemerédi, A lower bound for Heilbronn's problem, J. London Math. Soc. (2)25 (1982) 13-24.
101. J. Komlós, M. Simonovits, Szemerédi Regularity lemma and its application in Graph Theory, Paul Erdos is 80, Proceedings of the Colloquium Bolyai Mathematical Society, Vol. 2, Keszthely, 1993.
102. D.G. Larman, C.A. Rogers, The realization of distances within sets in Euclidean space, Mathematika 19 (1972) 1-24.
103. J. Kollár, L. Rónyai, T. Szabó, Norm graphs and bipartite Turán numbers, Combinatorica 16 (3) (1996) 399-406.
104. A.V. Kostochka, A class of constructions for Turán's (3,4) problem, Combinatorica 2 (2) (1982) 187-192.
105. L. Lovász, Kneser's conjecture, chromatic number, and homotopy, J. Combin. Theory A 25 (1978) 319-324.
106. A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan Conjecture and explicit construction of expanders (Extended Abstract), Proceedings of the STOC 1986, pp. 240-246.
107. A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs, Combinatorica 8 (3) (1988) 261-277.
108. E. Makai, P. Turán, Never published by the authors, reconstructed in several places.
109. G.A. Margulis, Arithmetic groups and graphs without short cycles, Proceedings of the Sixth International Symposium on Information Theory, Tashkent, Abstracts, Vol. 1, 1984, pp. 123-125 (in Russian).
110. G.A. Margulis, Some new constructions of low-density parity-check codes, convolution codes and multi-user communication, Proceedings of the Third International Seminar on Information Theory, Sochi, 1987, pp. 275-279 (in Russian).
111. G.A. Margulis, Explicit group theoretic construction of group theoretic schemes and their applications for the construction of expanders and concentrators, J. Problems Inform. Transmission, 1988, pp. 39-46 (translation from Problemy Peredachi Informatsii 24(1) (1988) 51-60).
112. G.A. Margulis, Explicit group theoretic construction of group theoretic schemes and their applications for the construction of expanders and concentrators, J. Problems Inform. Transmission, 1988, pp. 39-46 (translation from Problemy Peredachi Informatsii 24(1) (1988) 51-60).
113. 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.
114. D.J. Newman, L. Raymon, Optimally separated contractions, Amer. Math. Monthly 77 (1970) 58-59.
115. J. Pach, Graphs whose every independent set has a common neighbour, Discrete Math. 37 (1981) 217-228.
116. J. Pach, P.K. Agarwal, Combinatorial Geometry, Wiley Interscience, New York, 1995.
117. F.P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 2nd Ser. 30 (1930) 264-286.
118. I. Reiman, Über ein problem von K. Zarankiewicz, Acta Math. Acad. Sci. Hungar. 9 (1958) 269-273, MR 32 #2336.
119. K.F. Roth, On a problem of Heilbronn, III, Proc. London Math. Soc. (3) 25 (1972) 543-549; MR 46# 3452.
120. V. Rödl, On Universality of graphs with uniformly distributed edges, Discrete Math. 59 (1986) 125-143.
121. I.Z. Ruzsa, An infinite Sidon sequence, J. Number Theory 68 (1998) 63-71.
122. E. Schmidt, Die Brunn-Minkowski Ungleichung und ihr Spiegelbild sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und nichteuklidischen Geometrie I, Math Nachrichten, Berlin 1 (1948) 81-157.
123. I.J. Schonberg, Linkages and distance geometry, Proc. Koninkl. Neder. Akad. Wetenschap 72 (1969) 43-63.
124. J.J. Seidel, Quasi-regular two-distance sets, Proc. Koninkl. Neder. Akad. Wetenschap 72 (1969) 64-70.
125. E. Shamir, Generalized stability and chromatic numbers of random graphs, preprint, 1988, preprint.
126. A.F. Sidorenko, Classes of hypergraphs and probability inequalities, Klasszi gipergrafov i verojatnosztynije nyeravensztva, Doklady Akad. Nauk SSSR 254(3) (1980) 540-543. Math Reviews: 81m:05105 (English translation: Soviet Math. Dokl. 22(2) (1980) 399-402.)
127. A.F. Sidorenko, Classes of hypergraphs and probability inequalities, Klasszi gipergrafov i verojatnosztynije nyeravensztva, Doklady Akad. Nauk SSSR 254(3) (1980) 540-543. Math Reviews: 81m:05105 (English translation: Soviet Math. Dokl. 22(2) (1980) 399-402.)
128. A.F. Sidorenko, The method of quadratic forms in a combinatorial problem of Turán. Vestnik Moskov. Univ. Ser. I Mat. Mekh. 1982, no. 1, 3-6, 76. Math Reviews: 83g:05040.
129. A.F. Sidorenko, Extremal estimates of probability measures and their combinatorial nature Math. USSR - Izv 20 (1983) N3 503-533 MR 84d: 60031. (=Translation) Original: Izvest. Acad. Nauk SSSR. ser. matem. 46 (1982) N3 535-568. Math Reviews: 84d:60031.
130. A.F. Sidorenko, Extremal estimates of probability measures and their combinatorial nature Math. USSR - Izv 20 (1983) N3 503-533 MR 84d: 60031. (=Translation) Original: Izvest. Acad. Nauk SSSR. ser. matem. 46 (1982) N3 535-568. Math Reviews: 84d:60031.
131. A.F. Sidorenko, Asymptotic solution for a new class of forbidden r-graphs, Combinatorica 9 (2) (1989) 207-215.
132. A.F. Sidorenko, Extremal problems for k-colored graphs and unimprovable inequalities for pairs of random elements, Diskretnaya Matematika 1(3) (1989) 47-52 (in Russian). Math Reviews: 91a:05061
133. A.F. Sidorenko, An unimprovable inequality for the sum of two symmetrically distributed random vectors, Teor.-Veroyatnost.-i-Primenen. [Akademiya-Nauk-SSSR] 35(3) (1990) 595-599 (Translation: Theory of Probability and its Applications 35(3) (1990) 613-617 (1991)). Math Reviews: 93c:60021.
134. A.F. Sidorenko, An unimprovable inequality for the sum of two symmetrically distributed random vectors, Teor.-Veroyatnost.-i-Primenen. [Akademiya-Nauk-SSSR] 35(3) (1990) 595-599 (Translation: Theory of Probability and its Applications 35(3) (1990) 613-617 (1991)). Math Reviews: 93c:60021.
135. A.F. Sidorenko, Inequalities in probability theory and Turán-type problems for graphs with colored vertices, Random Struct. Algorithms 2(1) (1991) 73-99. Math Reviews: 92h:60024
136. A.F. Sidorenko, On Ramsey-Turán numbers for 3-graphs, J. Graph Theory 16 (1) (1992) 73-78.
137. M. Simonovits, A method of solving extremal problems in graph theory, in: P. Erdos, G. Katona (Eds.), Theory of Graphs, Proceedings of the Coll. Tihany, 1966, Academic Press, New York, 1968, pp. 279-319.
138. M. Simonovits, Extremal graph problems with conditions, Combinatorial theory and its applications, Coll. Math. Soc. J. Bolyai, Vol. 4, Balatonfüred, 1969, pp. 999-1011.
139. M. Simonovits, Note on a hypergraph extremal problem, in: C. Berge, D. Ray-Chaudury (Eds.), Hypergraph Seminar, Columbus, Ohio, USA, 1972, Lecture Notes in Mathematics, Vol. 411, Springer, Berlin, 1974, pp. 147-151. MR51#2987.
140. M. Simonovits, in: Beineke, Wilson (Ed.), Extremal Graph Theory, Selected Topics in Graph Theory, Academic Press, London, 1983, pp. 161-200.
141. M. Simonovits, V.T. Sós, Szemerédi's Partition and quasi-randomness, Random Struct. Algorithms 2 (1991) 1-10.
142. M. Simonovits, V.T. Sós, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Combinatorica 7(4) (1987), (1997) 577-596.
143. V.T. Sós, On extremal problems in graph theory, Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, 1969, pp. 407-410.
144. V.T. Śs, Remarks on the connection of graph theory, finite geometry and block designs, Colloquium Internazionale Sulle Teorie Combinatorie, Rome, Tomo II, 1973, pp. 223-233, Atti dei Convegni Lincei, Vol. 17, Accad Naz. Lincei Rome, 1976.
145. V.T. Śs, Remarks on the connection of graph theory, finite geometry and block designs, Colloquium Internazionale Sulle Teorie Combinatorie, Rome, Tomo II, 1973, pp. 223-233, Atti dei Convegni Lincei, Vol. 17, Accad Naz. Lincei Rome, 1976.
146. V.T. Sós, Interaction between number theory and graph theory, Conference on Discrete Mathematics, Preliminary Program of SIAM ANNUAL MEETING, 1999, University of Toronto, p. 53, Abstracts of Invited Plenary Lectures.
147. Gy. Szekeres, A Combinatorial Problem in Geometry, in the introducing part of [44, pp. xix-xxii].
148. E. Szemerédi, On graphs containing no complete subgraphs with 4 vertices, Mat. Lapok 23 (1972) 111-116 (in Hungarian).
149. E. Szemerédi, On regular partitions of graphs, In: J. Bermond et al. (Eds.), Problémes Combinatoires et Théorie des Graphes, Proceedings of the Conference, Orsay, 1976, CNRS, Paris, 1978, pp. 399-401.
150. A. Thomason, Random graphs, strongly regular graphs and pseudo-random graphs, in: Whitehead (Ed.), Surveys in Combinatorics, LMS Lecture Notes Series, Vol. 123, Cambridge University Press, Cambridge, 1987, pp. 173-196.
151. A. Thomason, Pseudo-random graphs, in: M. Karonski (Ed.), Proceedings of Random Graphs, Poznan, 1985, Annals of Discrete Mathematics, 33 (1987) 307-331.
152. M. Truszczynski, Z. Tuza, Linear upper bounds for local Ramsey numbers, Graphs Combin. 3 (1) (1987) 67-73.
153. P. Turán, On an extremal problem in graph theory, Mat. Lapok 48 (1941) 436-452 (in Hungarian) (see also [154] in English).
154. P. Turán, On the theory of graphs, Colloq. Math. 3 (1954) 19-30 (see also [154]).
155. P. Turán, Applications of graph theory to geometry and potential theory, Proceedings of the Calgary International Conference on Combinatorial Structures and their Application 1969, pp. 423-434 (see also [154]).
156. P. Turán, Constructive theory of functions, Proceedings of the International Conference in Varna, Bulgaria, 1970, Izdat, Bolgar Akad. Nauk, Sofia, 1972 (see also [154]).
157. P. Turán, Remarks on the packing constants of the unit sphere, Mat. Labok 21 (1970) 39-44 (in Hungarian).
158. P. Turán, A general inequality of potential theory, Proceedings of the Naval Research Laboratory, Washington, 1970, pp. 137-141 (see also [154]).
159. P. Turán, A Note of Welcome, J. Graph Theory 1 (1977) 7-9 (see also [154]).
160. Collected papers of Paul Turán, Vols. 1-3, Akadémiai Kiadó, Budapest, 1989.
161. A.A. Zykov, On some properties of linear complexes, Mat Sbornik 24 (1949) 163-188, Amer. Math. Soc. Translations 79 (1952).
162. A.A. Zykov, On some properties of linear complexes, Mat Sbornik 24 (1949) 163-188, Amer. Math. Soc. Translations 79 (1952).