×

Embedding graphs into larger graphs: results, methods, and problems. (English) Zbl 1443.05100

Bárány, Imre (ed.) et al., Building bridges II. Mathematics of László Lovász. Conference in celebration of László Lovász’ 70th birthday, Budapest, Hungary, July 2–6, 2018. Berlin: Springer. Bolyai Soc. Math. Stud. 28, 445-592 (2019).
Summary: Extremal graph theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which are new breakthrough results, or which – for some other reasons – are very close to us. Some results discussed here got stronger emphasis, since they are connected to L. Lovász (and sometimes to us).
For the entire collection see [Zbl 1443.05002].

MathOverflow Questions:

A geometric Ramsey problem

MSC:

05C35 Extremal problems in graph theory
05D10 Ramsey theory
05D40 Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
05C45 Eulerian and Hamiltonian graphs
05C65 Hypergraphs
05C80 Random graphs (graph-theoretic aspects)
05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Software:

MathOverflow
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Sarmad Abbasi: How tight is the Bollobás-Komlós conjecture?, Graphs Combin. 16 (2) (2000), 129-137. · Zbl 0961.05037
[2] Harvey L. Abbott and Andrew C.F. Liu: The existence problem for colour critical linear hypergraphs, Acta Math. Acad Sci Hung Tomus 32 (3-4) (1978), 273-282. · Zbl 0426.05026
[3] Martin Aigner and Stephan Brandt: Embedding arbitrary graphs of maximum degree two, J. London Math. Soc. (2), 48 (1993), 39-51. · Zbl 0796.05029
[4] Elad Aigner-Horev, David Conlon, Hiep Hàn, and Yury Person: Quasirandomness in hypergraphs, Electronic Notes in Discrete Mathematics 61 (2017) 13-19. · Zbl 1378.05141
[5] Elad Aigner-Horev, Hiep Hàn, and Mathias Schacht: Extremal results for odd cycles in sparse pseudorandom graphs, Combinatorica 34 (4) (2014), 379-406. · Zbl 1349.05176 · doi:10.1007/s00493-014-2912-y
[6] Miklós Ajtai, Paul Erdős, János Komlós, and Endre Szemerédi: On Turán’s theorem for sparse graphs, Combinatorica 1 (4) (1981) 313-317. · Zbl 0491.05038 · doi:10.1007/BF02579451
[7] M. Ajtai, J. Komlós, János Pintz, Joel Spencer, and E. Szemerédi: Extremal uncrowded hypergraphs, J. Combin. Theory Ser A 32 (1982), 321-335. · Zbl 0485.05049
[8] M. Ajtai, J. Komlós, Miklós Simonovits, and E. Szemerédi: Erdős-Sós Conjecture. (In preparation, in several manuscripts) · Zbl 0844.05037
[9] M. Ajtai, J. Komlós, and E. Szemerédi: A note on Ramsey numbers. J. Combin. Theory Ser. A 29 (3) (1980) 354-360. · Zbl 0455.05045 · doi:10.1016/0097-3165(80)90030-8
[10] M. Ajtai, J. Komlós, and E. Szemerédi: A dense infinite Sidon sequence, European J. Combin. 2 (1981), 1-11. · Zbl 0474.10038 · doi:10.1016/S0195-6698(81)80014-5
[11] M. Ajtai, J. Komlós, and E. Szemerédi: Sorting in \(c\,\log n\) parallel steps. Combinatorica 3 (1) (1983) 1-19. · Zbl 0523.68048
[12] M. Ajtai, J. Komlós, and E. Szemerédi: On a conjecture of Loebl, in Graph Theory, Combinatorics, and Algorithms, Vols. 1, 2 (Kalamazoo, MI, 1992), Wiley-Intersci. Publ., Wiley, New York, (1995), 1135-1146. · Zbl 0844.05037
[13] Vladimir E. Alekseev.: Range of values of entropy of hereditary classes of graphs (in Russian), Diskret. Mat. 4 (1992), 148-157. see also On the entropy values of hereditary classes of graphs. Discrete Math. Appl. 3 (1993) 191-199. · Zbl 0797.05077
[14] Peter Allen: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles, Combinatorics, Probability and Computing, 17 (4) (2008) 471-486. · Zbl 1169.05370 · doi:10.1017/S0963548308009164
[15] P. Allen, Julia Böttcher, Oliver Cooley, and Richard Mycroft: Tight cycles and regular slices in dense hypergraphs. J. Combin. Theory Ser. A 149 (2017), 30-100. arxiv:1411.4597. · Zbl 1358.05200 · doi:10.1016/j.jcta.2017.01.003
[16] P. Allen, J. Böttcher, Hiep Hàn, Y. Kohayakawa, and Y. Person: Powers of Hamilton cycles in pseudorandom graphs. LATIN 2014: theoretical informatics, 355-366, Lecture Notes in Comput. Sci., 8392, Springer, Heidelberg, 2014. · Zbl 1406.05092
[17] P. Allen, J. Böttcher, Hiep Hàn, Yoshiharu Kohayakawa, and Yury Person: Powers of Hamilton cycles in pseudorandom graphs. Combinatorica 37 (4) (2017), 573-616. · Zbl 1399.05118 · doi:10.1007/s00493-015-3228-2
[18] P. Allen, J. Böttcher, H. Hàn, Y. Kohayakawa, and Y. Person: Blow-up lemmas for sparse graphs, Submitted for publication, arXiv:1612.00622. (2018+)
[19] P. Allen, Peter Keevash, Benny Sudakov, and Jacques Verstraëte: Turán numbers of bipartite graphs plus an odd cycle, J. Combin. Theory Ser. B 106 (2014), 134-162. · Zbl 1297.05124 · doi:10.1016/j.jctb.2014.01.007
[20] Noga Alon: Eigenvalues and expanders, Combinatorica 6 (1986), 83-96. · Zbl 0661.05053 · doi:10.1007/BF02579166
[21] N. Alon: Independent sets in regular graphs and sum-free subsets of finite groups. Israel J. Math. 73 (1991) 247-256. · Zbl 0762.05050 · doi:10.1007/BF02772952
[22] N. Alon: Tools from Higher Algebra, Chapter 32 of Handbook of Combinatorics (ed. Graham, Lovász, Grötschel), (1995) pp. 1749-1783, North-Holland, Amsterdam. · Zbl 0848.05073
[23] N. Alon: Combinatorial Nullstellensatz, Combinatorics, Probability and Computing 8 (1999), 7-29. · Zbl 0920.05026 · doi:10.1017/S0963548398003411
[24] N. Alon, József Balogh, Béla Bollobás, and Robert Morris: The structure of almost all graphs in a hereditary property. J. Combin. Theory Ser. B, 101 (2) (2011) 85-110. · Zbl 1217.05193 · doi:10.1016/j.jctb.2010.10.001
[25] N. Alon, J. Balogh, R. Morris, and Wojciech Samotij: A refinement of the Cameron-Erdős conjecture, Proc. London Math. Soc. (3) 108 (1) (2014), no. 1, 44-72. · Zbl 1284.05024
[26] N. Alon, J. Balogh, R. Morris, and W. Samotij: Counting sum-free sets in Abelian groups, Israel J. Math. 199 (1) (2014), 309-344. arXiv:1201.6654. · Zbl 1332.11030 · doi:10.1007/s11856-013-0067-y
[27] N. Alon and M. Capalbo: Sparse universal graphs for bounded-degree graphs, Random Struct Algorithms 31 (2) (2007), 123-133. · Zbl 1133.05095
[28] N. Alon, M. Capalbo, Y. Kohayakawa, V. Rödl, A. Ruciński, and E. Szemerédi: Near-optimum universal graphs for graphs with bounded degrees (extended abstract), In Approximation, randomization, and combinatorial optimization (Berkeley, CA, 2001), Lecture Notes in Computer Science Vol. 2129, Springer, Berlin, 2001, pp. 170-180. · Zbl 1001.05086
[29] N. Alon and Fan R.K. Chung: Explicit construction of linear sized tolerant networks, Discrete Mathematics 72 (1988), Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), 15-19. · Zbl 0657.05068
[30] N. Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, and Raphael Yuster: The algorithmic aspects of the Regularity Lemma. J. Algorithms 16 (1994) 80-109. see also: the extended abstract, 33rd Annu Symp Foundations of Computer Science, Pittsburgh, IEEE Comput Soc. Press, New York, 1992, pp. 473-481. · Zbl 0915.05102
[31] N. Alon and P. Erdős: An application of graph theory to additive number theory, European J. Combin. 6 (3) (1985) 201-203. · Zbl 0581.10029 · doi:10.1016/S0195-6698(85)80027-5
[32] N. Alon and Elgar Fischer: 2-factors in dense graphs, Discrete Math., 152 (1996), 13-23. · Zbl 0851.05068
[33] N. Alon, E. Fischer, Michael Krivelevich, and Mário Szegedy: Efficient testing of large graphs, Combinatorica 20 (2000), 451-476. see also its extended abstract, Proc. 40th Ann. Symp. on Found. of Comp. Sci. IEEE (1999), 656-666. · Zbl 1052.68096
[34] N. Alon, E. Fischer, Ilan Newman, and Asaf Shapira: A combinatorial characterization of the testable graph properties: It’s all about regularity, SIAM J. Comput., 39(1) 143-167, 2009. STOC ’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 251-260. · Zbl 1301.05354
[35] N. Alon, P. Frankl, H. Huang, V. Rödl, A. Ruciński, and B. Sudakov: Large matchings in uniform hypergraphs and the conjecture of Erdős and Samuels, J. Combin. Theory Ser. A, 119 (2012), pp. 1200-1215. · Zbl 1242.05189 · doi:10.1016/j.jcta.2012.02.004
[36] N. Alon and Zoltán Füredi: Spanning subgraphs of random graphs, Graphs and Combin. 8 (1) (1992) 91-94. · Zbl 0767.05082
[37] N. Alon, Jeong-Han Kim, and J. Spencer: Nearly perfect matchings in regular simple hypergraphs. Israel J. Math. 100 (1997), 171-187. · Zbl 0882.05107
[38] N. Alon, M. Krivelevich, and B. Sudakov: Turán numbers of bipartite graphs and related Ramsey-type questions, Combin. Probab. Comput 12 (2003), 477-494. · Zbl 1060.05050 · doi:10.1017/S0963548303005741
[39] N. Alon and Vitalij D. Milman: Eigenvalues, expanders and superconcentrators, in Proceedings of the 25th FOCS, IEEE, New York, 1984, pp. 320-322.
[40] N. Alon, Ankur Moitra, and B. Sudakov: Nearly complete graphs decomposable into large induced matchings and their applications. J. Eur. Math. Soc. (JEMS) 15 (5) (2013) 1575-1596. See also in Proc. 44th ACM STOC,(2012) 1079-1089. · Zbl 1286.05128
[41] N. Alon, János Pach, Ron Pinchasi, Radoš Radoičić, and Micha Sharir: Crossing patterns of semi-algebraic sets, J. Combin. Theory, Ser. A 111 (2005) 310-326. · Zbl 1099.14048 · doi:10%E2%80%93326.
[42] N. Alon, Lajos Rónyai, and Tibor Szabó: Norm-graphs: Variations and application, J. Combin. Theory Ser. B 76 (1999), 280-290. · Zbl 0935.05054 · doi:10.1006/jctb.1999.1906
[43] N. Alon and Asaf Shapira: Every monotone graph property is testable, Proc. of the 37th ACM STOC, Baltimore, ACM Press (2005), 128-137. · Zbl 1192.68466
[44] N. Alon and A. Shapira: A characterization of the (natural) graph properties testable with one-sided error, Proc. 46th IEEE FOCS (2005), 429-438.
[45] N. Alon and A. Shapira: On an extremal hypergraph problem of Brown, Erdős and Sós, Combinatorica 26 (2006), 627-645. · Zbl 1121.05079 · doi:10.1007/s00493-006-0035-9
[46] N. Alon, A. Shapira, and Uri Stav: Can a graph have distinct regular partitions?, SIAM J. Discrete Math., 23 (2008/09), 278-287. · Zbl 1194.05120
[47] N. Alon and Clara Shikhelman: Many \(T\) copies in \(H\)-free graphs. J. Combin. Theory Ser. B 121 (2016), 146-172. · Zbl 1348.05100
[48] Noga Alon and Joel Spencer: “The Probabilistic Method”, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, 2016. xiv+375 pp. 4th, updated edition. · Zbl 1333.05001
[49] N. Alon and R. Yuster: H-factors in dense graphs. J. Combin. Theory Ser. B 66 (1996) 269-282. · Zbl 0855.05085 · doi:10.1006/jctb.1996.0020
[50] Richard P. Anstee, Balin Fleming, Z. Füredi, and Attila Sali: Color critical hypergraphs and forbidden configurations, in: S. Felsner, (Ed.) Discrete Mathematics and Theoretical Computer Science Proceedings, vol. AE, 2005, pp. 117-122. · Zbl 1192.05105
[51] Tim Austin: Deducing the multidimensional Szemerédi Theorem from an infinitary removal lemma. J. Anal. Math. 111 (2010) 131-150. · Zbl 1213.37015 · doi:10.1007/s11854-010-0014-3
[52] T. Austin: Deducing the density Hales-Jewett theorem from an infinitary removal lemma, J. Theoret. Probab. 24 (2011), 615-633. · Zbl 1235.60031 · doi:10.1007/s10959-011-0373-4
[53] T. Austin and Terrence C. Tao: Testability and repair of hereditary hypergraph properties, Random Struct Algor 36 (2010), 373-463. · Zbl 1208.05093
[54] Jacqueline Ayel: Sur l’existence de deux cycles supplémentaires unicolores, disjoints et de couleurs différentes dans un graph complet bicolore, Ph.D. thesis, Univ. Grenoble, 1979.
[55] László Babai: An anti-Ramsey theorem, Graphs Combin., 1 (1985), 23-28. · Zbl 0581.05040 · doi:10.1007/BF02582925
[56] L. Babai, M. Simonovits, and J. Spencer: Extremal subgraphs of random graphs, J. Graph Theory 14 (1990), 599-622. · Zbl 0738.05048 · doi:10.1002/jgt.3190140511
[57] L. Babai and Vera T. Sós: Sidon sets in groups and induced subgraphs of Cayley graphs, Europ. J. Combin. 6 (1985) 101-114. · Zbl 0573.05032
[58] Rahil Baber and John Talbot: Hypergraphs do jump. Combin. Probab. Comput. 20 (2) (2011), 161-171. · Zbl 1213.05184 · doi:10.1017/S0963548310000222
[59] Béla Bajnok: Additive Combinatorics, a menu of research problems, arXiv:1705:07444, to appear as a book. · Zbl 1415.11001
[60] József Balogh, János Barát, Dániel Gerbner, András Gyárfás and Gábor N. Sárközy: Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Combinatorica 34 (2014), 507-526. · Zbl 1340.05069 · doi:10.1007/s00493-014-2935-4
[61] J. Balogh, B. Bollobás, and Bhargav Narayanan: Transference for the Erdős-Ko-Rado theorem. Forum of Math. Sigma, (2015), e23, 18 pp. · Zbl 1323.05128
[62] J. Balogh, B. Bollobás, and M. Simonovits: The number of graphs without forbidden subgraphs, J. Combin. Theory Ser. B 91 (1) (2004) 1-24. · Zbl 1044.05044 · doi:10.1016/j.jctb.2003.08.001
[63] J. Balogh, B. Bollobás, and M. Simonovits: The typical structure of graphs without given excluded subgraphs, Random Structures and Algorithms 34 (2009), 305-318. · Zbl 1227.05216 · doi:10.1002/rsa.20242
[64] J. Balogh, B. Bollobás, and M. Simonovits: The fine structure of octahedron-free graphs, J. Combin. Theory Ser. B 101 (2011) 67-84. · Zbl 1239.05098 · doi:10.1016/j.jctb.2010.11.001
[65] J. Balogh, Neal Bushaw, Maurício Collares, Hong Liu, R. Morris, and Maryam Sharifzadeh: The typical structure of graphs with no large cliques. Combinatorica 37 (4) (2017) 617-632. arXiv:1406.6961, · Zbl 1399.05119
[66] J. Balogh, Jane Butterfield, Ping Hu, and John Lenz: Mantel’s theorem for random hypergraphs. Random Structures and Algorithms 48 (4) (2016) 641-654. · Zbl 1341.05176 · doi:10.1002/rsa.20629
[67] J. Balogh, Béla Csaba, Martin Pei, and W. Samotij: Large bounded degree trees in expanding graphs. Electron. J. Combin. 17 (1) (2010), Research Paper 6, 9 pp. · Zbl 1184.05022
[68] J. Balogh, B. Csaba, and W. Samotij: Local resilience of almost spanning trees in random graphs. Random Struct. Algor. 38 (2011) 121-139. · Zbl 1215.05154 · doi:10.1002/rsa.20345
[69] J. Balogh, P. Hu, and M. Simonovits: Phase transitions in Ramsey-Turán theory, J. Combin. Theory Ser. B 114 (2015) 148-169. · Zbl 1315.05097 · doi:10.1016/j.jctb.2015.04.005
[70] J. Balogh and John Lenz: Some exact Ramsey-Turán numbers, Bull. London Math. Soc. 44 (2012), 1251-1258. · Zbl 1254.05081
[71] J. Balogh and J. Lenz: On the Ramsey-Turán numbers of graphs and hypergraphs, Israel J. Math. 194 (2013), 45-68. · Zbl 1266.05084 · doi:10.1007/s11856-012-0076-2
[72] J. Balogh, Hong Liu, M. Sharifzadeh, and Andrew Treglown: The number of maximal sum-free subsets of integers, Proc. Amer. Math. Soc. 143 (11) (2015), 4713-4721. · Zbl 1378.11019
[73] J. Balogh, Allan Lo, and Theodore Molla: Transitive triangle tilings in oriented graphs. J. Combin. Theory Ser. B 124 (2017), 64-87. · Zbl 1398.05156 · doi:10.1016/j.jctb.2016.12.004
[74] J. Balogh, Andrew McDowell, T. Molla, and Richard Mycroft: Triangle-tilings in graphs without large independent sets, Combinatorics, Probability and Computing, 27 (4) (2018) 449-474. arXiv:1607.07789 · Zbl 1391.05199
[75] J. Balogh, T. Molla, and M. Sharifzadeh: Triangle factors of graphs without large independent sets and of weighted graphs. Random Structures and Algorithms 49 (4) (2016), 669-693. // Lingli Sun) · Zbl 1352.05141
[76] J. Balogh, R. Morris, and W. Samotij: Random sum-free subsets of Abelian groups, Israel J. Math. 199 (2) (2014), 651-685. · Zbl 1370.11040 · doi:10.1007/s11856-013-0071-2
[77] J. Balogh, R. Morris, and W. Samotij: Independent sets in hypergraphs. J. Amer. Math. Soc. 28 (3) (2015), 669-709. arXiv:1204.6530, · Zbl 1310.05154 · doi:10.1090/S0894-0347-2014-00816-X
[78] J. Balogh, R. Morris, and W. Samotij: The method of Hypergraph containers, ICM 2018, also arXiv:1801.04584v1 (2018)
[79] J. Balogh, R. Morris, W. Samotij, and Lutz Warnke: The typical structure of sparse \(K_{r+1}\)-free graphs. Trans. Amer. Math. Soc. 368 (9) (2016), 6439-6485. · Zbl 1332.05083
[80] J. Balogh, Frank Mousset, and Jozef Skokan: Stability for vertex cycle covers. Electron. J. Combin. 24 (3) (2017), Paper 3.56, 25 pp. · Zbl 1369.05116
[81] J. Balogh and Dhruv Mubayi: Almost all triple systems with independent neighborhoods are semi-bipartite, J. Combin. Theory Ser. A 118 (4) (2011), 1494-1518. · Zbl 1231.05188
[82] J. Balogh and D. Mubayi: Almost all triangle-free triple systems are tripartite, Combinatorica 32 (2) (2012), 143-169, · Zbl 1262.05109 · doi:10.1007/s00493-012-2657-4
[83] J. Balogh and Cory Palmer: On the tree packing conjecture, SIAM Journal on Discrete Mathematics 27 (2013), 1995-2006. · Zbl 1316.05098
[84] J. Balogh and šárka Petříčková: The number of the maximal triangle-free graphs. Bull. London Math. Soc. 46 (5) (2014), 1003-1006. · Zbl 1302.05087
[85] J. Balogh and W. Samotij: Almost all \(C_4\)-free graphs have fewer than \((1-\epsilon ){\rm ex}(n, C_4)\) edges, SIAM J. Discrete Math. 24 (2010) 1011-1018. · Zbl 1223.05129 · doi:10.1137/09074989X
[86] J. Balogh and W. Samotij: The number of \(K_{m,m}\)-free graphs, Combinatorica 31 (2) (2011) 131-150. · Zbl 1249.05190 · doi:10.1007/s00493-011-2610-y
[87] J. Balogh and W. Samotij: The number of \(K_{s,t}\)-free graphs, J. London Math. Soc. (2) 83 (2) (2011) 368-388. · Zbl 1227.05170
[88] J. Bang-Jensen and G. Gutin: Digraphs. Theory, algorithms and applications, Springer Monographs in Mathematics, Springer-Verlag, London, 2009. · Zbl 1170.05002
[89] Boaz Barak, Anup Rao, Ronen Shaltiel, and Avi Wigderson: 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction. Ann. of Math. (2) 176 (3) (2012), 1483-1543. · Zbl 1256.05146
[90] J. Barát, A. Gyárfás, Jenő Lehel, and G.N. Sárközy: Ramsey number of paths and connected matchings in Ore-type host graphs. Discrete Math. 339 (6) (2016), 1690-1698. · Zbl 1333.05193
[91] J. Barát and G.N. Sárközy: Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles. J. Graph Theory 81 (4) (2016), 317-328. · Zbl 1333.05235 · doi:10.1002/jgt.21877
[92] Ben Barber, Daniela Kühn, Allan Lo, Richard Montgomery, and Deryk Osthus: Fractional clique decompositions of dense graphs and hypergraphs. J. Combin. Theory Ser. B 127 (2017), 148-186. arXiv:1507.04985. · Zbl 1371.05226
[93] Ben Barber, D. Kühn, Allan Lo, and D. Osthus: Edge-decompositions of graphs with high minimum degree. Advances Math. 288 (2016), 337-385. · Zbl 1328.05145
[94] József Beck: On size Ramsey number of paths, trees, and circuits. I, J. Graph Theory 7 (1) (1983) 115-129. · Zbl 0508.05047
[95] J. Beck: An algorithmic approach to the Lovász local lemma. Rand. Struct. Algor. 2 (4) (1991) 343-365. · Zbl 0756.05080 · doi:10.1002/rsa.3240020402
[96] Felix A. Behrend: “On sets of integers which contain no three terms in arithmetical progression,” Proc. Nat. Acad. Sci. USA, 32 (12) (1946), 331-332, 1946. · Zbl 0060.10302
[97] Mathias Beiglböck: A variant of the Hales-Jewett theorem. Bull. London Math. Soc. 40 (2) (2008), 210-216. (2009c:05247) · Zbl 1154.05057
[98] Louis Bellmann and Christian Reiher: Turán’s theorem for the Fano plane, arXiv:1804.07673 · Zbl 1449.05192
[99] Fabricio S. Benevides and J. Skokan: The 3-colored Ramsey number of even cycles. J. Combin. Theory Ser. B 99 (4) (2009) 690-708. · Zbl 1227.05194
[100] Patrick Bennett and Andrzej Dudek: On the Ramsey-Turán number with small \(s\)-independence number. J. Combin. Theory Ser. B 122 (2017), 690-718. · Zbl 1350.05066 · doi:10.1016/j.jctb.2016.09.002
[101] Clark T. Benson: Minimal regular graphs of girth 8 and 12, Canad. J. Math. 18 (1966) 1091-1094. · Zbl 0151.17904 · doi:10.4153/CJM-1966-107-1
[102] Vitaly Bergelson and Alexander Leibman: Polynomial extensions of van der Waerden’s and Szemerédi’s theorems, J. Amer. Math. Soc. 9 (3) (1996) 725-753. · Zbl 0870.11015 · doi:10.1090/S0894-0347-96-00194-4
[103] V. Bergelson, A. Leibman: Set-polynomials and polynomial extension of the Hales-Jewett theorem, Ann. of Math. (2) 150 (1) (1999) 33-75. · Zbl 0969.05061
[104] J.C. Bermond, A. Germa, M.C. Heydemann, D. Sotteau: Hypergraphes hamiltoniens, in: Problèmes combinatoires et théorie des graphes, Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976, in: Colloq. Internat., vol. 260, CNRS, Paris, 1973, pp. 39-43. · Zbl 0413.05041
[105] J.-C. Bermond and Carsten Thomassen: Cycles in digraphs-a survey, J. Graph Theory 5 (1981), 1-43. · Zbl 0458.05035
[106] Claudia Bertram-Kretzberg, Thomas Hofmeister, H. Lefmann: An algorithm for Heilbronn’s problem, SIAM J. Comput., 30 (2) (2000) 383-390. · Zbl 0968.68065
[107] C. Bertram-Kretzberg and H. Lefmann: The Algorithmic Aspects of Uncrowded Hypergraphs, SIAM Journal on Computing 29 (1999) 201-230. · Zbl 0937.68056 · doi:10.1137/S0097539797323716
[108] Stéphane Bessy and Stéphan Thomassé: Partitioning a graph into a cycle and an anticycle, a proof of Lehel’s conjecture, Journal of Combinatorial Theory, Series B, 100 (2) (2010) 176-180. · Zbl 1216.05110 · doi:10.1016/j.jctb.2009.07.001
[109] Yuri Bilu: Sum-free sets and related sets, Combinatorica 18 (1998), 449-459. · Zbl 0968.11017 · doi:10.1007/s004930050032
[110] Yitzhak Birk, Nati Linial, and Roy Meshulam: On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels. IEEE Trans. Information Theory 39 (1993) 186-191. · Zbl 0825.94164 · doi:10.1109/18.179355
[111] G.R. Blakley and P. Roy: A Hölder type inequality for symmetric matrices with nonnegative entries, Proc. Amer. Math. Soc.16 (1965), 1244-1245. · Zbl 0142.27003
[112] Thomas F. Bloom: A quantitative improvement for Roth’s theorem on arithmetic progressions. J. London Math. Soc. (2) 93 (3) (2016), 643-663. arXiv:1405.5800. · Zbl 1364.11024
[113] Tom Bohman, Alan Frieze, and Ryan Martin: How many random edges make a dense graph Hamiltonian? Random Structures and Algorithms 22 (1) (2003), 33-42. · Zbl 1013.05044 · doi:10.1002/rsa.10070
[114] T. Bohman, A. Frieze, Miklós Ruszinkó, and Lubos Thoma: Vertex covers by edge disjoint cliques. Paul Erdős and his mathematics (Budapest, 1999). Combinatorica 21 (2) (2001), 171-197. · Zbl 0989.05057
[115] T. Bohman and P. Keevash: Dynamic concentration of the triangle-free process. arXiv:1302.5963 (2013), in The Seventh European Conference on Combinatorics, Graph Theory and Applications, CRM Series 16, Ed. Norm., Pisa, 2013, pp. 489-495. · Zbl 1291.05183
[116] B. Bollobás: Three-graphs without two triples whose symmetric difference is contained in a third, Discrete Mathematics 8 (1974), 21-24. · Zbl 0291.05114 · doi:10.1016/0012-365X(74)90105-8
[117] B. Bollobás: Relations between sets of complete subgraphs, in Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), Congressus Numerantium, Vol. 15, Utilitas Mathematica, Winnipeg, MB, (1976), pp. 79-84. · Zbl 0325.05118
[118] B. Bollobás: Complete subgraphs are elusive. J. Combinatorial Theory Ser. B 21 (1) (1976), no. 1, 1-7. · Zbl 0293.05158
[119] B. Bollobás: Extremal Graph Theory, Academic Press, London (1978). / Lond Math. Soc. Monogr 11, Academic Press, London-New York, 1978, pp. 488. · Zbl 0419.05031
[120] B. Bollobás: Extremal Graph Theory, Handbook of Combinatorics, Vol. 2, Elsevier, Amsterdam, (1995) pp. 1231-1292. · Zbl 0844.05054
[121] B. Bollobás: Random Graphs, second ed., Cambridge Stud. Advances Math., vol. 73, Cambridge Univ. Press, Cambridge, (2001). · Zbl 0979.05003
[122] B. Bollobás, David E. Daykin, and P. Erdős: Sets of independent edges of a hypergraph, Quart. J. Math. Oxford 21 (1976) 25-32. · Zbl 0337.05135
[123] B. Bollobás and Stephen E. Eldridge: Packing of Graphs and Applications to Computational Complexity, Journal of Combinatorial Theory, Series B 25 (1978), 105-124. · Zbl 0387.05020
[124] B. Bollobás and P. Erdős: On the structure of edge graphs, Bull. London Math. Soc. 5 (1973) 317-321. · Zbl 0277.05135 · doi:10.1112/blms/5.3.317
[125] B. Bollobás and P. Erdős: Cliques in random graphs. Math. Proc. Cambridge Philos. Soc. 80 (3) (1976), 419-427. · Zbl 0344.05155 · doi:10.1017/S0305004100053056
[126] B. Bollobás and P. Erdős: On a Ramsey-Turán type problem, J. Combin. Theory Ser. B 21 (1976), 166-168. · Zbl 0337.05134 · doi:10.1016/0095-8956(76)90057-5
[127] B. Bollobás, P. Erdős, and M. Simonovits: On the structure of edge graphs II, J. London Math. Soc., 12 (2) (1976) 219-224. · Zbl 0318.05110
[128] B. Bollobás, P. Erdős, M. Simonovits, and E. Szemerédi: Extremal graphs without large forbidden subgraphs. Advances in graph theory (Cambridge Combinatorial Conf., Trinity Coll., Cambridge, 1977). Ann. Discrete Math. 3 (1978), 29-41. · Zbl 0375.05034
[129] B. Bollobás, B. Narayanan and Andrei Raigorodskii: On the stability of the Erdős-Ko-Rado theorem, J. Combin. Theory Ser. A 137 (2016), 64-78. · Zbl 1325.05145
[130] B. Bollobás and Andrew G. Thomason: Projections of bodies and hereditary properties of hypergraphs, Bull. London Math. Soc. 27 (1995) 417-424. · Zbl 0836.05072
[131] B. Bollobás and A. Thomason: Hereditary and monotone properties of graphs, in: R.L. Graham and J. Nešetřil (Eds.): The Mathematics of Paul Erdős II, vol 14 of Algorithms Combin. Springer, Berlin Heidelberg, (1997) 70-78. · Zbl 0866.05030
[132] B. Bollobás and A. Thomason: On the girth of Hamiltonian weakly pancyclic graphs. J. Graph Theory 26 (3) (1997), 165-173. · Zbl 0888.05039 · doi:10.1002/(SICI)1097-0118(199711)26:3<165::AID-JGT7>3.0.CO;2-P
[133] B. Bollobás and A. Thomason: Weakly pancyclic graphs. J. Combin. Theory Ser. B 77 (1) (1999), 121-137. · Zbl 1023.05083 · doi:10.1006/jctb.1999.1916
[134] J. Adrian Bondy: Pancyclic graphs. I. J. Combin. Theory, Ser. B 11 (1971), 80-84. · Zbl 0183.52301
[135] J.A. Bondy and P. Erdős: Ramsey numbers for cycles in graphs. J. Combinatorial Theory Ser. B 14 (1973), 46-54. · Zbl 0248.05127 · doi:10.1016/S0095-8956(73)80005-X
[136] J.A. Bondy and M. Simonovits: Cycles of even length in graphs, J. Combin. Theory Ser. B 16 (1974) 97-105. · Zbl 0283.05108 · doi:10.1016/0095-8956(74)90052-5
[137] Christian Borgs, Jennifer T. Chayes, László Lovász: Moments of two-variable functions and the uniqueness of graph limits, Geom. Func. Anal., 19 (2010), 1597-1619. http://wuw.cs.elte.hu/ lovasz/limitunique.pdf · Zbl 1223.05193
[138] C. Borgs, J. Chayes and L. Lovász, V.T. Sós, Balázs Szegedy, and Katalin Vesztergombi: Graph limits and parameter testing, STOC ’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 261-270. · Zbl 1301.68199
[139] C. Borgs, J. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi: Counting graph homomorphisms. Topics in discrete mathematics, 315-371, Algorithms Combin. 26, Springer, Berlin, 2006. · Zbl 1129.05050
[140] C. Borgs, J. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi: Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing, Advances Math. 219 (6) (2008), 1801-1851 · Zbl 1213.05161 · doi:10.1016/j.aim.2008.07.008
[141] C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi: Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 (1) (2012), 151-219. · Zbl 1247.05124
[142] J. Böttcher, Jan Hladký, Diana Piguet, Anush Taraz: An approximate version of the tree packing conjecture, Israel J. Math. 211 (1) (2016) 391-446. · Zbl 1334.05111 · doi:10.1007/s11856-015-1277-2
[143] J. Böttcher, Y. Kohayakawa, A. Taraz, and Andreas Würfl: An extension of the blow-up lemma to arrangeable graphs, SIAM J. Discrete Math. 29 (2) (2015) 962-1001. arXiv:1305.2059. · Zbl 1314.05133
[144] J. Böttcher, M. Schacht, and A. Taraz: Proof of the bandwidth conjecture of Bollobás and Komlós. Math. Ann. 343 (1) (2009), 175-205. · Zbl 1229.05132 · doi:10.1007/s00208-008-0268-6
[145] Jean Bourgain: On triples in arithmetic progression, Geom. Funct. Anal. 9 (1999), 968-984. · Zbl 0959.11004 · doi:10.1007/s000390050105
[146] J. Bourgain, Alexander Gamburd, and Peter Sarnak: Affine linear sieve, expanders, and sum-product. Invent. Math. 179, (2010) 559-644. · Zbl 1239.11103 · doi:10.1007/s00222-009-0225-3
[147] S. Brandt, Ralph Faudree, and W. Goddard: Weakly pancyclic graphs, J. Graph Theory 27 (1998) 141-176. · Zbl 0927.05045
[148] Graham Brightwell, Konstantinos Panagiotou, and Angelika Steger: Extremal subgraphs of random graphs, Random Structures and Algorithms 41 (2012), 147-178. (Extended abstract: pp. 477-485 in SODA ‘07 (Proc. 18th ACM-SIAM Symp. Discrete Algorithms). · Zbl 1302.05166
[149] Hajo Broersma, Jan van den Heuvel, and Henk J. Veldman: A generalization of Ore’s Theorem involving neighborhood unions, Discrete Math. 122 (1993), 37-49. · Zbl 0789.05058 · doi:10.1016/0012-365X(93)90285-2
[150] William G. Brown: On graphs that do not contain a Thomsen graph, Can. Math. Bull. 9 (1966), 281-285. · Zbl 0178.27302 · doi:10.4153/CMB-1966-036-2
[151] W.G. Brown: On an open problem of Paul Turán concerning 3-graphs. In Studies in Pure Mathematics, (1983) Birkhäuser, Basel, pp. 91-93. · Zbl 0599.05033
[152] W.G. Brown, P. Erdős, and M. Simonovits: Extremal problems for directed graphs, J. Combin. Theory Ser B 15 (1973), 77-93. · Zbl 0253.05124 · doi:10.1016/0095-8956(73)90034-8
[153] W.G. Brown, P. Erdős, and M. Simonovits: Algorithmic solution of extremal digraph problems, Trans Amer Math. Soc. 292 (1985), 421-449. · Zbl 0607.05040 · doi:10.1090/S0002-9947-1985-0808730-0
[154] W.G. Brown, P. Erdős, and V.T. Sós: On the existence of triangulated spheres in 3-graphs and related problems, Period. Math. Hungar. 3 (1973) 221-228. · Zbl 0269.05111 · doi:10.1007/BF02018585
[155] W.G. Brown, P. Erdős, and V.T. Sós: Some extremal problems on \(r\)-graphs, in “New Directions in the Theory of Graphs,” Proc. 3rd Ann Arbor Conf. on Graph Theory, University of Michigan, 1971, pp. 53-63, Academic Press, New York, (1973). · Zbl 0258.05132
[156] W.G. Brown and Frank Harary: Extremal digraphs, Combinatorial theory and its applications, Colloq. Math. Soc. J. Bolyai, 4 (1970) I. 135-198 · Zbl 0209.28501
[157] W.G. Brown and John W. Moon: Sur les ensembles de sommets indépendants dans les graphes chromatiques minimaux. (French) Canad. J. Math. 21 (1969) 274-278. · Zbl 0179.29103
[158] W.G. Brown and M. Simonovits: Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures, Discrete Math., 48 (1984) 147-162. · Zbl 0541.05035 · doi:10.1016/0012-365X(84)90178-X
[159] W.G. Brown and M. Simonovits: Extremal multigraph and digraph problems, Paul Erdős and his mathematics, II (Budapest, 1999), pp. 157-203, Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest, (2002). · Zbl 1029.05080
[160] K. O’Bryant: A complete annotated bibliography of work related to Sidon sequences, Electron. J. Combin. (2004), Dynamic Surveys 11, 39 pp. (electronic). · Zbl 1142.11312
[161] Boris Bukh and David Conlon: Random algebraic construction of extremal graphs. Bull. London Math. Soc. 47 (2015), 939-945. · Zbl 1328.05098
[162] B. Bukh and D. Conlon: Rational exponents in extremal graph theory. J. Eur. Math. Soc. (JEMS) 20 (7) (2018), 1747-1757. · Zbl 1393.05161 · doi:10.4171/JEMS/798
[163] B. Bukh and Zilin Jiang: A bound on the number of edges in graphs without an even cycle. Combin. Probab. Comput. 26 (1) (2017) 1-15. arXiv:1403.1601, see also the erratum. · Zbl 1371.05138
[164] S.A. Burr and P. Erdős: On the magnitude of generalized Ramsey numbers for graphs, in: Infinite and Finite Sets, vol. 1, Keszthely, 1973, in: Colloq. Math. Soc. János Bolyai, vol. 10, North-Holland, Amsterdam, 1975, pp. 214-240. · Zbl 0316.05110
[165] S.A. Burr, P. Erdős, Peter Frankl, Ron L. Graham, and V.T. Sós: Further results on maximal antiramsey graphs, In Graph Theory, Combinatorics and Applications, Vol. I, Y. Alavi, A. Schwenk (Editors), John Wiley and Sons, New York, 1988, pp. 193-206. · Zbl 0840.05061
[166] S.A. Burr, P. Erdős, R.L. Graham, and V.T. Sós: Maximal antiramsey graphs and the strong chromatic number, J. Graph Theory 13 (1989), 263-282. · Zbl 0682.05046 · doi:10.1002/jgt.3190130302
[167] S.A. Burr, P. Erdős, and L. Lovász: On graphs of Ramsey type. Ars Combinatoria 1 (1) (1976) 167-190. · Zbl 0333.05120
[168] Sebastián Bustamante, H. Hàn, and Maya Stein: Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles. arXiv:1701.07806v1. · Zbl 1414.05205
[169] S. Bustamante, Jan Corsten, Nóra Frankl, Alexey Pokrovskiy, and J. Skokan: Partitioning edge-coloured hypergraphs into few monochromatic tight cycles, arXiv:1903.04771v1 (2019)
[170] Louis Caccetta and Roland Häggkvist: On diameter critical graphs, Discrete Math. 28 (1979) 223-229. · Zbl 0421.05042
[171] Dominic de Caen: The current status of Turán’s problem on hypergraphs, Extremal problems for finite sets (Visegrád, 1991), 187-197, Bolyai Soc. Math. Stud. 3 (1994), János Bolyai Math. Soc., Budapest. · Zbl 0820.05042
[172] Dominic de Caen and Zoltán Füredi: The maximum size of 3-uniform hypergraphs not containing a Fano plane, Journal of Combinatorial Theory. Series B 78 (2000), 274-276. · Zbl 1027.05073
[173] Peter J. Cameron: ‘Portrait of a typical sum-free set’, Surveys in combinatorics, London Mathematical Society Lecture Note 123 (ed. C. Whitehead; Cambridge University Press, Cambridge, 1987) 13-42. · Zbl 0677.05063
[174] Peter J. Cameron and P. Erdős: ‘Notes on sum-free and related sets’, Recent trends in combinatorics (Mátraháza, 1995), Combinatorics, Probability and Computing 8 (Cambridge University Press, Cambridge, 1999) 95-107. · Zbl 0927.11004
[175] Paul A. Catlin: Subgraphs of graphs I., Discrete Math. 10 (1974), 225-233. · Zbl 0289.05122 · doi:10.1016/0012-365X(74)90119-8
[176] Chan, Tsz Ho, Ervin Győri, and András Sárközy: On a problem of Erdős on integers, none of which divides the product of \(k\) others. European J. Combin. 31 (1) (2010) 260-269. · Zbl 1255.11008 · doi:10.1016/j.ejc.2009.02.005
[177] Phong Châu, Louis DeBiasio, and Henry A. Kierstead: Pósa’s conjecture for graphs of order at least \(8\times 10^9\), Random Struct Algorithms 39 (4) (2011), 507-525. · Zbl 1238.05157 · doi:10.1002/rsa.20376
[178] Sarvadaman Chowla: Solution of a problem of Erdős and Turán in additive-number theory. Proc. Nat. Acad. Sci. India. Sect. A 14 (1-2) (1944). · Zbl 0063.00874
[179] Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas: The strong perfect graph theorem. Ann. of Math. 164 (2006) 51-229. · Zbl 1112.05042
[180] Fan R.K. Chung: Quasi-random classes of hypergraphs. Random Struct. Algorithms 1 (1980) 363-382 MR1138430 Corrigendum: Quasi-random classes of hypergraphs, Random Struct Algorithms 1 (1990), 363-382. · Zbl 0739.05066
[181] F.R.K. Chung: Regularity lemmas for hypergraphs and quasi-randomness. Random Structures and Algorithms 2 (2) (1991) 241-252. · Zbl 0756.05081
[182] F.R.K. Chung: Quasi-random hypergraphs revisited. Random Structures and Algorithms 40 (1) (2012), 39-48. · Zbl 1236.05179 · doi:10.1002/rsa.20388
[183] F.R.K. Chung and R.L. Graham: Quasi-random tournaments. J. Graph Theory 15 (2) (1991), 173-198. · Zbl 0728.05025 · doi:10.1002/jgt.3190150206
[184] F.R.K. Chung and R.L. Graham: Quasi-random subsets of \({\mathbb{Z}}_n \), J. Combin. Theory Ser. A 61 (1) (1992), 64-86. · Zbl 0779.05046
[185] F.R.K. Chung, R.L. Graham, and Richard M. Wilson: Quasi-random graphs, Combinatorica 9 (1989), 345-362. · Zbl 0715.05057
[186] Vaclav Chvátal: Tree-complete graph Ramsey numbers. J. Graph Theory 1 (1) (1977), 93. · Zbl 0351.05120 · doi:10.1002/jgt.3190010118
[187] V. Chvátal, V. Rödl, E. Szemerédi, and W. Tom Trotter Jr.: The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (3) (1983) 239-243. · Zbl 0547.05044
[188] V. Chvátal and E. Szemerédi: On the Erdős-Stone Theorem, J. London Math. Soc. (2) 23 (1981/2), 207-214. · Zbl 0485.05034
[189] Javier Cilleruelo: Infinite Sidon sequences. Advances Math. 255 (2014), 474-486. · Zbl 1302.11006
[190] J. Cilleruelo and Craig Timmons: \(k\)-fold Sidon sets. Electron. J. Combin. 21 (4) (2014) Paper 4.12, 9 pp. · Zbl 1298.05316
[191] Sebastian M. Cioabă: Bounds on the Turán density of \(PG_3(2)\), Electronic J. Combin. 11 (2004) 1-7. · Zbl 1053.05066
[192] David Conlon: Hypergraph packing and sparse bipartite Ramsey numbers, Combin. Probab. Comput. 18 (2009) 913-923. · Zbl 1191.05064 · doi:10.1017/S0963548309990174
[193] D. Conlon: Combinatorial theorems relative to a random set, in: Proceedings of the International Congress of Mathematicians, Vol. IV (2014), 303-327. arXiv:1404.3324, 2014. · Zbl 1373.05175
[194] D. Conlon and Jacob Fox: Bounds for graph regularity and removal lemmas, Geom. Funct. Anal. 22 (2012) 1191-1256. · Zbl 1256.05114
[195] D. Conlon and J. Fox: Graph removal lemmas, Surveys in combinatorics 2013, Vol. 409, London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, (2013), 1-49. · Zbl 1301.05309
[196] D. Conlon, J. Fox, and B. Sudakov: On two problems in graph Ramsey theory, Combinatorica 32 (2012), 513-535. · Zbl 1289.05332
[197] D. Conlon, J. Fox, and B. Sudakov: Hereditary quasirandomness without regularity. Math. Proc. Cambridge Philos. Soc. 164 (3) (2018), 385-399. · Zbl 1391.05227 · doi:10.1017/S0305004116001055
[198] D. Conlon, J. Fox, and Yufei Zhao: Extremal results in sparse pseudorandom graphs. Advances Math., 256 (2014), 206-290. arXiv:1204.6645v1 · Zbl 1285.05096
[199] D. Conlon and W. Timothy Gowers: Combinatorial theorems in sparse random sets, Ann. of Math. (2) 184 (2) (2016) 367-454. arXiv:1011.4310v1. · Zbl 1351.05204
[200] D. Conlon, W.T. Gowers, W. Samotij, and M. Schacht: On the KŁR conjecture in random graphs. Israel J. Math., 203 (2014), 535-580. · Zbl 1303.05175 · doi:10.1007/s11856-014-1120-1
[201] D. Conlon and M. Stein: Monochromatic cycle partitions in local edge colorings. J. Graph Theory 81 (2) (2016), 134-145. arXiv:1403.5975v3. · Zbl 1330.05125
[202] O. Cooley: Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs, Discrete Math., 309 (2009), 6190-6228. · Zbl 1184.05067 · doi:10.1016/j.disc.2009.05.030
[203] O. Cooley, D. Kühn, and D. Osthus: Perfect packings with complete graphs minus an edge, European J. Combin., 28 (2007), 2143-2155. · Zbl 1136.05055 · doi:10.1016/j.ejc.2007.04.002
[204] O. Cooley and R. Mycroft: The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. Discrete Math. 340 (6) (2017), 1172-1179. arXiv:1606.05616. · Zbl 1369.05036
[205] Joshua N. Cooper: Quasirandom permutations. J. Combin. Theory Ser. A 106 (1) (2004), 123-143. · Zbl 1043.60009 · doi:10.1016/j.jcta.2004.01.006
[206] Jeff Cooper, Kunal Dutta, and Dhruv Mubayi: Counting independent sets in hypergraphs. Combin. Probab. Comput. 23 (4) (2014), 539-550. · Zbl 1304.05105 · doi:10.1017/S0963548314000182
[207] Jeff Cooper and Dhruv Mubayi: Counting independent sets in triangle-free graphs, Proc. Amer. Math. Soc. 142 (10) (2014) 3325-3334, · Zbl 1300.05169 · doi:10.1090/S0002-9939-2014-12068-5
[208] J. Cooper and D. Mubayi: Sparse hypergraphs with low independence numbers, Combinatorica, 37 (1) (2017), 31-40. · Zbl 1399.05168 · doi:10.1007/s00493-014-3219-8
[209] Keresztély Corrádi and András Hajnal: On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar 14 (1963) 423-439. · Zbl 0118.19001 · doi:10.1007/BF01895727
[210] Ernie Croot, Vsevolod F. Lev, and Péter Pál Pach: Progression-free sets in \({\mathbb{Z}}^n_4\) are exponentially small. Ann. of Math. (2) 185 (1) (2017) 331-337. · Zbl 1425.11019
[211] Béla Csaba: The Bollobás-Eldridge conjecture for graphs of maximum degree four. Manuscript (2003).
[212] B. Csaba: On the Bollobás-Eldridge conjecture for bipartite graphs. Combin. Probab. Comput 16 (2007), 661-691. · Zbl 1136.05029 · doi:10.1017/S0963548307008395
[213] B. Csaba: Regular spanning subgraphs of bipartite graphs of high minimum degree. Electron. J. Combin. 14 (1) (2007), Note 21, 7 pp. · Zbl 1157.05322
[214] B. Csaba: On embedding well-separable graphs. Discrete Math. 308 (19) (2008), 4322-4331. · Zbl 1157.05032 · doi:10.1016/j.disc.2007.08.015
[215] B. Csaba, Ian Levitt, Judit Nagy-György, and E. Szemerédi: Tight bounds for embedding bounded degree trees, in Fete of Combinatorics and Computer Science, Bolyai Soc. Math. Stud. 20, János Bolyai Math. Soc., Budapest, 2010, pp. 95-137. · Zbl 1225.05140
[216] B. Csaba and Marcello Mydlarz: Approximate multipartite version of the Hajnal-Szemerédi theorem. J. Combin. Theory Ser. B 102 (2) (2012), 395-410.arXiv:0807.4463v1. · Zbl 1239.05100
[217] B. Csaba, Ali Shokoufandeh, and E. Szemerédi: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three. Paul Erdős and his mathematics (Budapest, 1999). Combinatorica 23 (1) (2003), 35-72. · Zbl 1046.05040
[218] Andrzej Czygrinow and Louis DeBiasio: A note on bipartite graph tiling. SIAM J. Discrete Math. 25 (4) (2011), 1477-1489. · Zbl 1237.05108 · doi:10.1137/100788203
[219] A. Czygrinow, L. DeBiasio, H.A. Kierstead, and T. Molla: An extension of the Hajnal-Szemerédi theorem to directed graphs. Combin. Probab. Comput. 24 (5) (2015), 754-773. · Zbl 1371.05101 · doi:10.1017/S0963548314000716
[220] A. Czygrinow, DeBiasio, Louis; Molla, Theodore; Treglown, Andrew: Tiling directed graphs with tournaments. Forum Math. Sigma 6 (2018), e2, 53 pp. · Zbl 1406.05080
[221] A. Czygrinow, L. DeBiasio, and Brendan Nagle: Tiling 3-uniform hypergraphs with \(K^3_4-2e\). J. Graph Theory 75 (2) (2014), 124-136. arXiv:1108.4140. · Zbl 1280.05093
[222] A. Czygrinow, Vikram Kamat: Tight co-degree condition for perfect matchings in 4-graphs. Electron. J. Combin. 19 (2) (2012) Paper 20, 16 pp. · Zbl 1244.05176
[223] A. Czygrinow, H.A. Kierstead, and T. Molla: On directed versions of the Corrádi-Hajnal corollary. European J. Combin. 42 (2014) 1-14. · Zbl 1297.05185 · doi:10.1016/j.ejc.2014.05.006
[224] A. Czygrinow, T. Molla: Tight codegree condition for the existence of loose Hamilton cycles in 3-graphs, SIAM J. Discrete Math. 28 (2014) 67-76. · Zbl 1296.05113 · doi:10.1137/120890417
[225] A. Czygrinow, S. Poljak, and V. Rödl: Constructive quasi-Ramsey numbers and tournament ranking, SIAM J. Discrete Math 12 (1999), 48-63. · Zbl 0933.68099 · doi:10.1137/S0895480197318301
[226] S. Das and T. Tran: Removal and stability for Erdős-Ko-Rado. SIAM J. Discrete Math. 30 (2) (2016), 1102-1114. arXiv:1412.7885. · Zbl 1336.05141 · doi:10.1137/15M105149X
[227] Giuliana Davidoff, Peter Sarnak, and Alain Valette: Elementary number theory, group theory, and Ramanujan graphs, London Math. Soc. Stud. Texts 55, Cambridge University Press, Cambridge 2003. · Zbl 1032.11001
[228] Evan Davies, Matthew Jenssen, Will Perkins, and Barnaby Roberts: On the average size of independent sets in triangle-free graphs. Proc. Amer. Math. Soc. 146 (1) (2018), 111-124. arXiv:1508.04675. · Zbl 1375.05194
[229] David Daykin and R. Häggkvist: Degrees giving independent edges in a hypergraph, Bull. Austral. Math. Soc., 23 (1981), 103-109. · Zbl 0442.05050
[230] L. DeBiasio, Safi Faizullah, and Imdadullah Khan: Ore-degree threshold for the square of a Hamiltonian cycle. Discrete Math. Theor. Comput. Sci. 17 (1) (2015), 13-32. · Zbl 1306.05135
[231] Louis DeBiasio and Tao Jiang: On the co-degree threshold for the Fano plane. European J. Combin. 36 (2014), 151-158. · Zbl 1284.05187 · doi:10.1016/j.ejc.2013.05.030
[232] L. DeBiasio and Luke L. Nelsen: Monochromatic cycle partitions of graphs with large minimum degree, Journal of Combinatorial Theory, Ser. B 122 (2017), 634-667. arXiv:1409.1874v1. · Zbl 1350.05135
[233] Domingos Dellamonica, Kalyanasundaram Subrahmanyam, Daniel Martin, V. Rödl and Asaf Shapira: An optimal algorithm for finding Frieze-Kannan regular partitions. Combin. Probab. Comput. 24 (2) (2015) 407-437. · Zbl 1371.05141
[234] Bobby DeMarco: Triangles in Random Graphs, thesis defense, Rutgers University, May 3, (2012).
[235] B. DeMarco and Jeff Kahn: Mantel’s theorem for random graphs. Random Structures and Algorithms 47 (1) (2015), 59-72. · Zbl 1328.05169
[236] B. DeMarco and J. Kahn: Turán’s theorem for random graphs, Submitted for publication, arXiv:1501.01340 (2015). · Zbl 1328.05169
[237] Tristan Denley: The independence number of graphs with large odd girth. Electron. J. Combin. 1 (1994), Research Paper 9, approx. 12 pp. · Zbl 0814.05045
[238] Walther A. Deuber, Alexander V. Kostochka, and Horst Sachs: A shorter proof of Dirac’s theorem on the number of edges in chromatically critical graphs, Diskretnyi Analiz Issledovanie Operacii 3 (4) (1996) 28-34 (in Russian). · Zbl 0920.05030
[239] Pat Devlin and Jeff Kahn: On “stability” in the Erdős-Ko-Rado theorem. SIAM J. Discrete Math. 30 (2) (2016), 1283-1289. · Zbl 1338.05130
[240] Palahenedi H. Diananda and Hian Poh Yap: Maximal sum-free sets of elements of finite groups, Proceedings of the Japan Academy 45 (1969), 1-5. · Zbl 0179.04801 · doi:10.3792/pja/1195520891
[241] Rainer Dietmann, Christian Elsholtz, Katalin Gyarmati, and M. Simonovits: Shifted products that are coprime pure powers. J. Combin. Theory Ser. A 111 (1) (2005), 24-36. · Zbl 1131.11013
[242] Gabor A. Dirac: Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), 68-81. · Zbl 0047.17001
[243] G.A. Dirac: A property of 4-chromatic graphs and some remarks on critical graphs, J. London Math. Soc. 27 (1952) 85-92. · Zbl 0046.41001 · doi:10.1112/jlms/s1-27.1.85
[244] G.A. Dirac: Extension of Turán’s theorem on graphs. Acta Math. Acad. Sci. Hungar 14 (1963) 417-422. · Zbl 0113.24703 · doi:10.1007/BF01895726
[245] G.A. Dirac: The number of edges in critical graphs, J. Reine Angew. Math. 268/269 (1974) 150-164. · Zbl 0298.05119
[246] P. Drineas, P., A. Frieze, R. Kannan, S. Vempala, and V. Vinay: Clustering large graphs via the singular value decomposition. Mach. Learn. 56 (2004) 9-33. · Zbl 1089.68090
[247] Andrzej Dudek, C. Reiher, Andrzej Rucinski, and M. Schacht: Powers of Hamiltonian cycles in randomly augmented graphs, arXiv:1805.10676v1, 2018 May 17 · Zbl 1444.05080
[248] Richard A. Duke, H. Lefmann, and V. Rödl: On uncrowded hypergraphs, In: Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, “Random Graphs ’93” (Poznań, 1993), Random Struct Algorithms 6 (1995), 209-212. · Zbl 0822.05051
[249] R.A. Duke and V. Rödl: On graphs with small subgraphs of large chromatic number, Graphs Combin. 1 (1) (1985) 91-96. · Zbl 0581.05023 · doi:10.1007/BF02582932
[250] Nancy Eaton: Ramsey numbers for sparse graphs, Discrete Math. 185 (1998) 63-75. · Zbl 0955.05071 · doi:10.1016/S0012-365X(97)00184-2
[251] Gábor Elek and B. Szegedy: Limits of hypergraphs, removal and regularity lemmas. A non-standard approach, preprint. arXiv:0705.2179. · Zbl 1251.05115
[252] G. Elek and B. Szegedy: A measure-theoretic approach to the theory of dense hypergraphs. Advances Math. 231 (3-4) (2012), 1731-1772. arXiv:0810.4062. · Zbl 1251.05115
[253] György Elekes: On the number of sums and products. Acta Arithmetica 81 (4) (1997): 365-367. · Zbl 0887.11012
[254] Michael Elkin: An improved construction of progression-free sets. Israel J. Math. 184 (2011), 93-128. (See also: ACM-SIAM Symposium on Discrete Algorithms, SODA’10, Austin, TX, USA, (2010) pp. 886-905. arXiv:0801.4310. · Zbl 1288.11011
[255] Jordan Ellenberg and Dion Gijswijt: On large subsets of \({\mathbb{F}}^n_q\) with no three-term arithmetic progression. Ann. of Math. (2) 185 (1) (2017) 339-343. · Zbl 1425.11020
[256] David Ellis: Stability for \(t\)-intersecting families of permutations, J. Combin. Theory Ser. A 118 (2011) 208-227. · Zbl 1234.05229 · doi:10.1016/j.jcta.2010.04.005
[257] D. Ellis, Nathan Keller, and Noam Lifshitz: Stability versions of Erdős-Ko-Rado type theorems, via isoperimetry, J. Eur. Math. Soc. (2016). arXiv:1604.02160. · Zbl 1429.05198
[258] Paul Erdős: On sequences of integers no one of which divides the product of two others and on some related problems, Mitt. Forsch.-Inst. Math. Mech. Univ. Tomsk 2 (1938) 74-82. · Zbl 0020.00504
[259] P. Erdős: On a problem of Sidon in additive number theory and on some related problems. Addendum, J. London Math. Soc. 19 (1944), 208. · Zbl 0061.07302
[260] P. Erdős: On sets of distances of \(n\) points, Amer. Math. Monthly 53 (1946), 248-250. · Zbl 0060.34805 · doi:10.1080/00029890.1946.11991674
[261] P. Erdős, ‘Some remarks on the theory of graphs’, Bull. Amer. Math. Soc. 53 (1947) 292-294. · Zbl 0032.19203 · doi:10.1090/S0002-9904-1947-08785-1
[262] P. Erdős: On a problem of Sidon in additive number theory, Acta Sci Math. Szeged 15 (1954), 255-259. · Zbl 0057.03901
[263] P. Erdős: Graph theory and probability. Canad. J. Math. 11 (1959) 34-38. · Zbl 0084.39602 · doi:10.4153/CJM-1959-003-9
[264] P. Erdős: Graph theory and probability. II. Canad. J. Math. 13 (1961) 346-352. · Zbl 0097.39102 · doi:10.4153/CJM-1961-029-9
[265] P. Erdős: On a theorem of Rademacher-Turán, Illinois J. Math. 6 (1962), 122-127. · Zbl 0099.39401 · doi:10.1215/ijm/1255631811
[266] P. Erdős: On extremal problems of graphs and generalized graphs, Israel J. Math. 2 (3) (1964) 183-190. · Zbl 0129.39905 · doi:10.1007/BF02759942
[267] P. Erdős: Extremal problems in graph theory, in: M. Fiedler (Ed.), Theory of Graphs and Its Applications, 2nd ed., Proc. Symp., Smolenice, 1963, Academic Press, New York, 1965, pp. 29-36. · Zbl 0161.20501
[268] P. Erdős: A problem on independent \(r\)-tuples, Ann. Univ. Sci. Budapest. 8 (1965) 93-95. · Zbl 0136.21302
[269] P. Erdős: Some recent results on extremal problems in graph theory. Results, Theory of Graphs (Internat. Sympos., Rome, 1966), Gordon and Breach, New York, Dunod, Paris, (1967), pp. 117-123 (English); pp. 124-130 (French). · Zbl 0187.21003
[270] P. Erdős: On some applications of graph theory to geometry, Canad. J. Math. 19 (1967), 968-971. · Zbl 0161.20603
[271] P. Erdős: On some new inequalities concerning extremal properties of graphs. In Theory of Graphs (Proc. Colloq., Tihany, 1966), Academic Press, New York, (1968), 77-81. · Zbl 0161.43306
[272] P. Erdős: On some applications of graph theory to number theoretic problems, Publ. Ramanujan Inst. No. (1968/1969), 131-136. · Zbl 0208.05601
[273] P. Erdős: Some applications of graph theory to number theory, The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich., 1968), pp. 77-82, Springer, Berlin, (1969). · Zbl 0187.21002
[274] P. Erdős: On the number of complete subgraphs and circuits contained in graphs. Časopis Pěst. Mat. 94 (1969) 290-296. · Zbl 0177.52502
[275] P. Erdős: Some applications of graph theory to number theory, Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C., 1970), pp. 136-145, · Zbl 0214.30603
[276] P. Erdős: On the application of combinatorial analysis to number theory, geometry and analysis, Actes du Congrès International des Mathématiciens (Nice, 1970), Tome 3, pp. 201-210, Gauthier-Villars, Paris, 1971. · Zbl 0231.05003
[277] P. Erdős: The Art of Counting. Selected writings of P. Erdős, (J. Spencer ed.) Cambridge, The MIT Press (1973). · Zbl 0287.01028
[278] P. Erdős, Some problems in graph theory, in: Hypergraph Seminar, Ohio State Univ., Columbus, Ohio, 1972, in: Lecture Notes in Math., vol. 411, Springer, Berlin, (1974), pp. 187-190. · Zbl 0297.05133
[279] P. Erdős: Problems and results in graph theory and combinatorial analysis, in: Proceedings of the Fifth British Combinatorial Conference, Univ. Aberdeen, Aberdeen, 1975, Congr. Numer. 15 (1976) 169-192. · Zbl 0335.05002
[280] P. Erdős: Paul Turán, 1910-1976: his work in graph theory, J. Graph Theory 1 (2) (1977) 97-101, · Zbl 0383.05022 · doi:10.1002/jgt.3190010204
[281] P. Erdős: Some personal reminiscences of the mathematical work of Paul Turán. Acta Arith. 37 (1980), 4-8. · Zbl 0368.10004
[282] P. Erdős: Some applications of Ramsey’s theorem to additive number theory, European J. Combin. 1 (1) (1980) 43-46. · Zbl 0442.10037 · doi:10.1016/S0195-6698(80)80020-5
[283] P. Erdős: Some notes on Turán’s mathematical work. P. Turán memorial volume. J. Approx. Theory 29 (1) (1980), 2-5. · Zbl 0444.01024
[284] P. Erdős: Some applications of graph theory and combinatorial methods to number theory and geometry, Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), Colloq. Math. Soc. János Bolyai, 25, pp. 137-148, North-Holland, Amsterdam-New York, 1981. · Zbl 0472.10001
[285] P. Erdős: Some old and new problems in combinatorial geometry, Applications of discrete mathematics (Clemson, SC, 1986), pp. 32-37, SIAM, Philadelphia, PA, 1988 · Zbl 0663.05013
[286] P. Erdős: On some aspects of my work with Gabriel Dirac, in: L.D. Andersen, I.T. Jakobsen, C. Thomassen, B. Toft, P.D. Vestergaard (Eds.), Graph Theory in Memory of G.A. Dirac, Annals of Discrete Mathematics, Vol. 41, North-Holland, Amsterdam, 1989, pp. 111-116. · Zbl 0664.01008
[287] P. Erdős: On some of my favourite theorems. Combinatorics, Paul Erdős is eighty, Vol. 2 (Keszthely, 1993), 97-132, Bolyai Soc. Math. Stud., 2, János Bolyai Math. Soc., Budapest, 1996. · Zbl 0853.11001
[288] 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 (1986), 113-121. · Zbl 0593.05038 · doi:10.1007/BF01788085
[289] P. Erdős and Tibor Gallai: On maximal paths and circuits of graphs, Acta Math. Sci. Hungar. 10 (1959) 337-356. · Zbl 0090.39401
[290] P. Erdős, A.W. Goodman, and Lajos Pósa: The representation of a graph by set intersections, Canad. J. Math, 18 (1966), 106-112. · Zbl 0137.43202 · doi:10.4153/CJM-1966-014-3
[291] P. Erdős, A. Gyárfás, and László Pyber: Vertex coverings by monochromatic cycles and trees, J. Combin. Theory Ser. B 51 (1991) 90-95. · Zbl 0766.05062 · doi:10.1016/0095-8956(91)90007-7
[292] P. Erdős, A. Hajnal, M. Simonovits, V.T. Sós, and E. Szemerédi: Turán-Ramsey theorems and simple asymptotically extremal structures, Combinatorica 13 (1993), 31-56. · Zbl 0774.05050 · doi:10.1007/BF01202788
[293] P. Erdős, A. Hajnal, M. Simonovits, V.T. Sós, and E. Szemerédi: Turán-Ramsey theorems and \(K_p\)-independence number, in: Combinatorics, geometry and probability (Cambridge, 1993), Cambridge Univ. Press, Cambridge, 1997, 253-281. · Zbl 0876.05050
[294] P. Erdős, A. Hajnal, M. Simonovits, V.T. Sós, and E. Szemerédi: Turán-Ramsey theorems and \(K_p\)-independence numbers, Combin. Probab. Comput. 3 (1994) 297-325. · Zbl 0812.05031 · doi:10.1017/S0963548300001218
[295] P. Erdős, A. Hajnal, V.T. Sós, and E. Szemerédi: More results on Ramsey-Turán type problem, Combinatorica 3 (1983), 69-81. · Zbl 0526.05031 · doi:10.1007/BF02579342
[296] P. Erdős and Haim Hanani: On a limit theorem in combinatorial analysis, Publ. Math. Debrecen 10 (1963) 10-13. · Zbl 0122.24802
[297] P. Erdős, Daniel J. Kleitman, and Bruce L. Rothschild: Asymptotic enumeration of \(K_n\)-free graphs, in Colloquio Internazionale sulle Teorie Combinatorie, Tomo II, Atti dei Convegni Lincei, no. 17 (Accad. Naz. Lincei, Rome) (1976), 19-27. · Zbl 0358.05027
[298] P. Erdős, Chao Ko, and Richard Rado: Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2), 12 (1961), 313-320. · Zbl 0100.01902
[299] P. Erdős and L. Lovász: Problems and results on 3-chromatic hypergraphs and some related questions, A. Hajnal (Ed.), Infinite and Finite Sets, North Holland, 1975, pp. 609-628. · Zbl 0315.05117
[300] P. Erdős, Amram Meir, V.T. Sós, and 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. · Zbl 0218.52005
[301] P. Erdős, A. Meir, V.T. Sós, and P. Turán: On some applications of graph theory I, Discrete Math. 2 (3) (1972) 207-228. · Zbl 0236.05119 · doi:10.1016/0012-365X(72)90004-0
[302] P. Erdős, A. Meir, V.T. Sós, and P. Turán: On some applications of graph theory III, Canadian Math. Bull. 15 (1972) 27-32. · Zbl 0232.05003 · doi:10.4153/CMB-1972-006-0
[303] P. Erdős, A. Meir, V.T. Sós, and P. Turán, Corrigendum: ‘On some applications of graph theory, I’. [Discrete Math. 2(3) (1972) 207-228]; Discrete Math. 4 (1973) 90. · Zbl 0236.05119
[304] P. Erdős, S.B. Rao, M. Simonovits, and V.T. Sós: On totally supercompact graphs. Combinatorial mathematics and applications (Calcutta, 1988). Sankhya Ser. A 54 (1992), Special Issue, 155-167. · Zbl 0882.05077
[305] P. Erdős and Alfréd Rényi: Additive properties of random sequences of positive integers, Acta Arith. 6 (1960) 83-110. · Zbl 0091.04401
[306] P. Erdős and A. Rényi: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kut. Int. Közl. 5 (1960) 17-61. (Also see [277], 574-617) · Zbl 0103.16301
[307] P. Erdős, A. Rényi: On the strength of connectedness of a random graph, Acta Math. Acad. Sci. Hungar. 12 (1961) 261-267. · Zbl 0103.16302 · doi:10.1007/BF02066689
[308] P. Erdős, A. Rényi, and V.T. Sós: On a problem of graph theory. Stud. Sci. Math. Hung. 1 (1966) 215-235 (Also see [277], 201-221) · Zbl 0144.23302
[309] P. Erdős and C. Ambrose Rogers: ‘The construction of certain graphs’, Canad. J. Math. 14 (1962) 702-707. · Zbl 0194.25304
[310] P. Erdős and H. Sachs: Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. (German) Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 12 (1963) 251-257. · Zbl 0116.15002
[311] P. Erdős, András Sárközy, and V.T. Sós: On product representations of powers, I, European J. Combin. 16 (1995) 567-588. · Zbl 0840.11010
[312] P. Erdős and M. Simonovits: A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966) 51-57. (Reprinted in [277], 1973, pp. 194-200.). · Zbl 0178.27301
[313] P. Erdős and M. Simonovits: Some extremal problems in graph theory, Combinatorial theory and its applications, Vol. I, Proceedings Colloqium, Balatonfüred, (1969), North-Holland, Amsterdam, 1970, pp. 377-390.(Reprinted in [277]). · Zbl 0209.28001
[314] P. Erdős and M. Simonovits: An extremal graph problem, Acta Math. Acad. Sci. Hungar. 22 (1971/72), 275-282. · Zbl 0234.05118
[315] P. Erdős and M. Simonovits: On the chromatic number of Geometric graphs, Ars Combin. 9 (1980) 229-246. · Zbl 0466.05031
[316] P. Erdős and M. Simonovits: Supersaturated graphs and hypergraphs, Combinatorica 3 (1983) 181-192. · Zbl 0529.05027 · doi:10.1007/BF02579292
[317] P. Erdős and M. Simonovits: Cube supersaturated graphs and related problems, in: J.A. Bondy, U.S.R. Murty (Eds.), Progress in Graph Theory, Acad. Press, 203-218 (1984) · Zbl 0565.05042
[318] P. Erdős and M. Simonovits: How many colours are needed to colour every pentagon of a graph in five colours? (manuscript, to be published)
[319] P. Erdős and V.T. Sós: Some remarks on Ramsey’s and Turán’s theorem, in: Combinatorial theory and its applications, II (Proc. Colloq., Balatonfüred, 1969), North-Holland, Amsterdam, (1970), 395-404. · Zbl 0209.28002
[320] P. Erdős and J. Spencer: Probabilistic methods in combinatorics, Probability and Mathematical Statistics, Vol. 17, Academic, New York, London, (1974), · Zbl 0308.05001
[321] P. Erdős and Arthur H. Stone: On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946) 1087-1091. · Zbl 0063.01277
[322] P. Erdős and E. Szemerédi: On sums and products of integers. In: Studies in Pure Mathematics, Birkhäuser, Basel, 213-218 (1983). · Zbl 0526.10011
[323] P. Erdős and P. Turán: On some sequences of integers, J. London Math. Soc. 11 (1936), 261-264. · JFM 62.1126.01 · doi:10.1112/jlms/s1-11.4.261
[324] P. Erdős and P. Turán: On a problem of Sidon in additive number theory, and on some related problems, J. London Math. Soc. 16 (1941), 212-215. Addendum (by P. Erdős) J. London Math. Soc. 19 (1944), 208. · JFM 67.0984.03
[325] Beka Ergemlidze, Ervin Győri, and Abhishek Methuku: A note on the linear cycle cover conjecture of Gyárfás and Sárközy. Electron. J. Combin. 25 (2) (2018), Paper 2.29, 4 pp. · Zbl 1390.05107
[326] Vance Faber: The Erdős-Faber-Lovász conjecture-the uniform regular case. J. Combin. 1 (2) (2010), 113-120. · Zbl 1225.05190 · doi:10.4310/JOC.2010.v1.n2.a2
[327] V. Faber and L. Lovász: Unsolved problem #18, page 284 in Hypergraph Seminar, Ohio State University, 1972, edited by C. Berge and D. Ray-Chaudhuri.
[328] Genghua Fan: On diameter 2-critical graphs, Discrete Math., 67 (3) (1987) 235-240 · Zbl 0634.05041 · doi:10.1016/0012-365X(87)90174-9
[329] G. Fan and R. Häggkvist: The square of a Hamiltonian cycle, SIAM J. Discrete Math. (1994) 203-212. · Zbl 0801.05041
[330] G. Fan and H.A. Kierstead: The square of paths and cycles, Journal of Combinatorial Theory, Ser. B, 63 (1995), 55-64. · Zbl 0826.05040
[331] R.J. Faudree, Ronald J. Gould, Mike S. Jacobson, and Richard H. Schelp: On a problem of Paul Seymour, Recent Advances in Graph Theory (V. R. Kulli ed.), Vishwa International Publication (1991), 197-215. · Zbl 0817.05002
[332] R.J. Faudree, R.H. Schelp: All Ramsey numbers for cycles in graphs. Discrete Math. 8 (1974) 313-329. · Zbl 0294.05122 · doi:10.1016/0012-365X(74)90151-4
[333] R.J. Faudree and R.H. Schelp: Ramsey type results, in: A. Hajnal, et al. (Eds.), Infinite and Finite Sets, in: Colloq. Math. J. Bolyai, vol. 10, North-Holland, Amsterdam, (1975) pp. 657-665. · Zbl 0311.05124
[334] R. J. Faudree and R.H. Schelp: Path Ramsey numbers in multicolorings, Journal of Combinatorial Theory, Ser. B 19 (1975), 150-160. · Zbl 0286.05111
[335] R.J. Faudree and R.H. Schelp: Path-path Ramsey-type numbers for the complete bipartite graph, J. Combin. Theory Ser. B 19, (1975), 161-173. · Zbl 0305.05108 · doi:10.1016/0095-8956(75)90081-7
[336] R.J. Faudree and M. Simonovits: Ramsey problems and their connection to Turán-type extremal problems. J. Graph Theory 16 (1992) 25-50. · Zbl 0770.05075 · doi:10.1002/jgt.3190160105
[337] Odile Favaron, Evelyne Flandrin, Hao Li, and Feng Tian: An Ore-type condition for pancyclability, Discrete Math. 206 (1999), 139-144. · Zbl 0929.05045 · doi:10.1016/S0012-365X(98)00399-9
[338] Asaf Ferber, Gal Kronenberg, and Eoin Long: Packing, Counting and Covering Hamilton cycles in random directed graphs. Electron. Notes Discrete Math. 49 (2015) 813-819. · Zbl 1346.05151 · doi:10.1016/j.endm.2015.06.109
[339] A. Ferber, Rajko Nenadov, Andreas Noever, Ueli Peter, and N. škorić: Robust hamiltonicity of random directed graphs, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 15) (2015), 1752-1758. · Zbl 1371.05264
[340] A. Ferber, Rajko Nenadov, and U. Peter: Universality of random graphs and rainbow embedding, Random Structures and Algorithms 48 (2016), 546-564. · Zbl 1338.05248
[341] Agnieszka Figaj and Tomasz Łuczak: The Ramsey number for a triple of long even cycles. J. Combin. Theory Ser. B 97 (4) (2007) 584-596. · Zbl 1120.05060
[342] A. Figaj and T. Łuczak: The Ramsey Numbers for A Triple of Long Cycles. Combinatorica 38 (4) (2018), 827-845. · Zbl 1424.05208
[343] David C. Fisher: Lower bounds on the number of triangles in a graph. J. Graph Theory 13 (1989) 505-512. · Zbl 0673.05046 · doi:10.1002/jgt.3190130411
[344] Mathew Fitch: Rational exponents for hypergraph Turán problems. arXiv:1607.05788. · Zbl 1401.05203
[345] G. Fiz Pontiveros, Simon Griffiths, R. Morris: The triangle-free process and \(R(3,k)\), arXiv:1302.6279. · Zbl 1439.05001
[346] Dmitrii G. Fon-Der-Flaass: “Method for Construction of (3,4)-Graphs”, Mat. Zametki 44 (4) (1998), 546-550; [Math. Notes 44, 781-783 (1988)]. · Zbl 0766.05061
[347] Jacob Fox: A new proof of the graph removal lemma, Ann. of Math. 174 (2011) 561-579. · Zbl 1231.05133
[348] J. Fox, Mikhail Gromov, Vincent Lafforgue. Assaf Naor, and J. Pach: Overlap properties of geometric expanders. J. Reine Angew. Math. 671 (2012), 49-83. · Zbl 1306.05171
[349] J. Fox, Po-Shen Loh, and Yufei Zhao: The critical window for the classical Ramsey-Turán problem. Combinatorica 35 (4) (2015) 435-476. · Zbl 1374.05131 · doi:10.1007/s00493-014-3025-3
[350] J. Fox, László Miklós Lovász, and Yufei Zhao: On regularity lemmas and their algorithmic applications. Combin. Probab. Comput. 26 (4) (2017), 481-505. · Zbl 1371.05286 · doi:10.1017/S0963548317000049
[351] J. Fox, J. Pach, and Andrew Suk: Density and regularity theorems for semi-algebraic hypergraphs. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1517-1530, SIAM, Philadelphia, PA, (2015). · Zbl 1375.05185
[352] J. Fox and B. Sudakov: Density theorems for bipartite graphs and related Ramsey-type results, Combinatorica 29 (2009) 153-196. · Zbl 1212.05261 · doi:10.1007/s00493-009-2475-5
[353] J. Fox and B. Sudakov: Dependent random choice, Random Structures and Algorithms 38 (2011) 68-99. · Zbl 1215.05159 · doi:10.1002/rsa.20344
[354] Peter Frankl: All rationals occur as exponents, J. Combin. Theory Ser. A 42 (1985) 200-206. · Zbl 0603.05001 · doi:10.1016/0097-3165(86)90090-7
[355] P. Frankl and Z. Füredi: An exact result for 3-graphs, Discrete Math. 50 (1984) 323-328. · Zbl 0538.05050 · doi:10.1016/0012-365X(84)90058-X
[356] P. Frankl and V. Rödl: Hypergraphs do not jump, Combinatorica 4 (1984), 149-159. · Zbl 0663.05047 · doi:10.1007/BF02579215
[357] P. Frankl and V. Rödl: Near perfect coverings in graphs and hypergraphs, European Journal of Combinatorics 6 (1985), 317-326. · Zbl 0624.05055 · doi:10.1016/S0195-6698(85)80045-7
[358] P. Frankl and V. Rödl: The uniformity lemma for hypergraphs. Graphs Combin. 8 (4) (1992) 309-312. · Zbl 0777.05084 · doi:10.1007/BF02351586
[359] P. Frankl and R.M. Wilson: Intersection theorems with geometric consequences, Combinatorica 1 (1981) 357-368. · Zbl 0498.05048 · doi:10.1007/BF02579457
[360] Mike Freedman, L. Lovász, and Alex Schrijver: Reflection positivity, rank connectivity, and homomorphism of graphs. J. AMS 20 (2007), 37-51. · Zbl 1107.05089
[361] G.A. Freiman: Foundations of a structural theory of set addition, Kazan Gos. Ped. Inst., Kazan, 1966 (Russian). English translation in Translations of Mathematical Monographs 37, American Mathematical Society, Providence, 1973. · Zbl 0271.10044
[362] Ehud Friedgut: On the measure of intersecting families, uniqueness and stability; Combinatorica 28 (5) (2008), 503-528. · Zbl 1199.05319 · doi:10.1007/s00493-008-2318-9
[363] Joel Friedman and Nick Pippenger: Expanding graphs contain all small trees, Combinatorica 7 (1987), 71-76. · Zbl 0624.05028 · doi:10.1007/BF02579202
[364] Alan Frieze and Ravi Kannan: The Regularity Lemma and approximation schemes for dense problems, Proc IEEE Symp Found Comput Sci, 1996, pp. 12-20.
[365] A. Frieze and R. Kannan: Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220. · Zbl 0933.68061 · doi:10.1007/s004930050052
[366] A. Frieze and R. Kannan: A simple algorithm for constructing Szemerédi’s regularity partition. Electron. J. Combin., 6, (1999). 74 · Zbl 0917.05070
[367] A. Frieze, R. Kannan, and Santosh Vempala: Fast Monte-Carlo algorithms for finding low-rank approximations. J. ACM 51 (6) (2004), 1025-1041. · Zbl 1125.65005
[368] Shinya Fujita, Henry Liu, and Colton Magnant: Monochromatic structures in edge-coloured graphs and hypergraphs-a survey, International Journal of Graph Theory and its Applications, 1 (1) (2015) pp3-56. · Zbl 1320.05040
[369] Zoltán Füredi: Matchings and covers in hypergraphs, Graphs Combin. 4 (1988) 115-206. · Zbl 0820.05051 · doi:10.1007/BF01864160
[370] Z. Füredi: Turán type problems, in Surveys in Combinatorics (1991), Proc. of the 13th British Combinatorial Conference, (A. D. Keedwell ed.) Cambridge Univ. Press. London Math. Soc. Lecture Note Series 166 (1991), 253-300. · Zbl 0727.05032
[371] Z. Füredi: The maximum number of edges in a minimal graph of diameter 2, J. Graph Theory 16 (1992) 81-98. · Zbl 0773.05063 · doi:10.1002/jgt.3190160110
[372] Z. Füredi: Extremal hypergraphs and combinatorial geometry, in: Proc. Internat. Congress of Mathematicians, vols. 1, 2, Zürich, 1994, Birkhäuser, Basel, (1995), pp. 1343-1352. · Zbl 0839.05077
[373] Z. Füredi: An upper bound on Zarankiewicz’ problem. Combin. Probab. Comput. 5 (1996) 29-33 · Zbl 0857.05048 · doi:10.1017/S0963548300001814
[374] Z. Füredi: A proof of the stability of extremal graphs, Simonovits’ stability from Szemerédi’s regularity. J. Combin. Theory Ser. B 115 (2015), 66-71. · Zbl 1319.05074
[375] Z. Füredi, Alexander Kostochka, and Ruth Luo: A stability version for a theorem of Erdős on nonhamiltonian graphs. Discrete Math. 340 (11) (2017), 2688-2690. · Zbl 1369.05118 · doi:10.1016/j.disc.2016.08.030
[376] Z. Füredi, A. Kostochka, Ruth Luo, and J. Verstraëte: Stability in the Erdős-Gallai Theorem on cycles and paths, II. Discrete Math. 341 (5) (2018), 1253-1263. · Zbl 1383.05172
[377] Z. Füredi, A. Kostochka, and J. Verstraëte: Stability in the Erdős-Gallai theorems on cycles and paths. J. Combin. Theory Ser. B 121 (2016), 197-228. · Zbl 1348.05105 · doi:10.1016/j.jctb.2016.06.004
[378] Z. Füredi and André Kündgen: Turán problems for weighted graphs, J. Graph Theory 40 (2002), 195-225. · Zbl 0997.05048
[379] Z. Füredi, D. Mubayi, and O. Pikhurko: Quadruple systems with independent neighborhoods. J. Combin. Theory Ser. A 115 (8) (2008), 1552-1560. · Zbl 1190.05036 · doi:10.1016/j.jcta.2008.01.008
[380] Z. Füredi, O. Pikhurko, and M. Simonovits: The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\). Electronic J. Combin. 10 # R18 (2003) · Zbl 1011.05031
[381] Z. Füredi, O. Pikhurko, and M. Simonovits: On triple systems with independent neighbourhoods, Combin. Probab. Comput. 14 (5-6) (2005), 795-813, · Zbl 1079.05062 · doi:10.1017/S0963548305006905
[382] Z. Füredi, O. Pikhurko, and M. Simonovits: 4-books of three pages. J. Combin. Theory Ser. A 113 (5) (2006), 882-891. · Zbl 1098.05041 · doi:10.1016/j.jcta.2005.03.012
[383] Z. Füredi and M. Ruszinkó: Uniform hypergraphs containing no grids. Advances Math. 240 (2013), 302-324. arXiv:1103.1691 · Zbl 1278.05161 · doi:10.1016/j.aim.2013.03.009
[384] Z. Füredi and A. Sali: Some new bounds on partition critical hypergraphs. European J. Combin. 33 (5) (2012), 844-852. · Zbl 1239.05131 · doi:10.1016/j.ejc.2011.09.023
[385] Z. Füredi and M. Simonovits: Triple systems not containing a Fano configuration, Combin. Probab. Comput. 14 (4) (2005), 467-484. · Zbl 1075.05062 · doi:10.1017/S0963548305006784
[386] Z. Füredi and M. Simonovits: The history of degenerate (bipartite) extremal graph problems, in Erdős Centennial, Bolyai Soc. Math. Stud., 25, János Bolyai Math. Soc., Budapest, (2013) 169-264. arXiv:1306.5167. · Zbl 1296.05098
[387] Hillel Fürstenberg: Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Analyse Math. 31 (1977), 204-256. · Zbl 0347.28016 · doi:10.1007/BF02813304
[388] H. Fürstenberg and Yitzhak Katznelson: An ergodic Szemerédi theorem for commuting transformations, J. Analyse Math. 34 (1978) 275-291. · Zbl 0426.28014
[389] H. Fürstenberg and Y. Katznelson: A density version of the Hales-Jewett theorem, J. Analyse Math. 57 (1991), 64-119. · Zbl 0770.05097 · doi:10.1007/BF03041066
[390] László Gerencsér and András Gyárfás: On Ramsey-type problems, Ann. Univ. Sci. Budapest. Eötvös Sect. Math., 10 (1967), 167-170. · Zbl 0163.45502
[391] Stefanie Gerke, Y. Kohayakawa, V. Rödl, and A. Steger: Small subsets inherit sparse \(\epsilon \)-regularity, J. Combin. Theory Ser. B 97 (1) (2007) 34-56. · Zbl 1111.05090
[392] S. Gerke and A. Steger: The sparse regularity lemma and its applications, in: B.S. Webb (Ed.), Surveys Combinatorics 2005, University of Durham, 2005, in: London Math. Soc. Lecture Note Ser., vol. 327, Cambridge Univ. Press, Cambridge, 2005, pp. 227-258. · Zbl 1129.05021
[393] Alfred Geroldinger and Imre Z. Ruzsa: Combinatorial number theory and additive group theory. Courses and seminars from the DocCourse in Combinatorics and Geometry held in Barcelona, 2008. Advanced Courses in Mathematics. CRM Barcelona. Birkhäuser Verlag, Basel, 2009. xii+330 pp. ISBN: 978-3-7643-8961-1
[394] Roman Glebov, Y. Person, and Wilma Weps: On extremal hypergraphs for Hamiltonian cycles. European J. Combin. 33 (4) (2012) 544-555. · Zbl 1237.05142 · doi:10.1016/j.ejc.2011.10.003
[395] Stephan Glock, D. Kühn, Allan Lo, R. Montgomery, and D. Osthus: On the decomposition threshold of a given graph, arXiv:1603.04724, 2016. · Zbl 1428.05246
[396] S. Glock, D. Kühn, Allan Lo, and D. Osthus: The existence of designs via iterative absorption, arXiv:1611.06827, (2016).
[397] S. Glock, D. Kühn, Allan Lo, and D. Osthus: Hypergraph \(F\)-designs for arbitrary \(F\), arXiv:1706.01800, (2017).
[398] S. Glock, D. Kühn, and D. Osthus: Optimal path and cycle decompositions of dense quasirandom graphs. J. Combin. Theory Ser. B 118 (2016), 88-108. · Zbl 1332.05078 · doi:10.1016/j.jctb.2016.01.004
[399] O. Goldreich, S. Goldwasser and D. Ron: Property testing and its connection to learning and approximation, Journal of the ACM 45 (1998), 653-750. · Zbl 1065.68575 · doi:10.1145/285055.285060
[400] Adolph W. Goodman: On sets of acquaintances and strangers at any party. Amer. Math. Monthly 66 (1959) 778-783. · Zbl 0092.01305 · doi:10.1080/00029890.1959.11989408
[401] W. Timothy Gowers: Lower bounds of tower type for Szemerédi’s uniformity lemma, GAFA, Geom. Func. Anal. 7 (1997), 322-337. · Zbl 0876.05053
[402] W.T. Gowers: A new proof of Szemerédi’s theorem for arithmetic progressions of length four, Geom. Funct. Anal. 8 (1998), 529-551. MR 1631259 132, 138 MR1631259 // A new proof of Szemerédi’s theorem, Geom. Funct. Anal. 11 (2001), 465-588; Erratum, Geom Funct. Anal. 11 (2001), 869 · Zbl 0907.11005
[403] W.T. Gowers: Quasirandomness, counting and regularity for 3-uniform hypergraphs, Combinatorics, Probability and Computing 15 (2006), 143-184. · Zbl 1082.05081 · doi:10.1017/S0963548305007236
[404] W.T. Gowers: Hypergraph regularity and the multidimensional Szemerédi theorem, Ann. of Math. (2) 166 (3) (2007) 897-946. arXiv:0710.3032. · Zbl 1159.05052
[405] W.T. Gowers: Quasirandom groups. Combin. Probab. Comput. 17, (2008) 363-387 · Zbl 1191.20016 · doi:10.1017/S0963548307008826
[406] W.T. Gowers: Polymath and the density Hales-Jewett theorem. An irregular mind, 659-687, Bolyai Soc. Math. Stud., 21, János Bolyai Math. Soc., Budapest, (2010). · Zbl 1223.05305
[407] W.T. Gowers: A Geometric Ramsey Problem, http://mathoverflow.net/questions/50928/a-geometric-ramsey-problem, accessed May 2016.
[408] W.T. Gowers and Omid Hatami: Inverse and stability theorems for approximate representations of finite groups, arXiv:1510.04085 [math.GR]. · Zbl 1427.20022
[409] R.L. Graham and B.L. Rothschild: Ramsey’s theorem for \(n\)-parameter sets, Trans. Amer. Math. Soc. 159 (1971), 257-292. · Zbl 0233.05003
[410] R.L. Graham, B.L. Rothschild, and J.H. Spencer: Ramsey Theory, Wiley, New York, 1990. 2nd edition · Zbl 0705.05061
[411] R.L. Graham, V. Rödl, and A. Ruciński: On graphs with linear Ramsey numbers, J. Graph Theory 35 (2000) 176-192. · Zbl 0965.05073 · doi:10.1002/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C
[412] Andrew Granville and József Solymosi: Sum-product formulae. Recent trends in combinatorics, 419-451, IMA Vol. Math. Appl., 159, Springer, [Cham], 2016. · Zbl 1407.11043
[413] J. Ben Green: The Cameron-Erdős conjecture, Bull. London Math. Soc. 36 (2004) 769-778. · Zbl 1074.11013
[414] J. B. Green: A Szemerédi-type regularity lemma in abelian groups, with applications, Geom. Funct. Anal. 15 (2) (2005) 340-376. · Zbl 1160.11314 · doi:10.1007/s00039-005-0509-8
[415] B. Green and I.Z. Ruzsa: Sum-free sets in abelian groups, Israel J. Math. 147 (2005), 157-188. · Zbl 1158.11311 · doi:10.1007/BF02785363
[416] B. Green and T.C. Tao: The primes contain arbitrarily long arithmetic progressions, Annals of Mathematics 167 (2008), 481-547. · Zbl 1191.11025 · doi:10.4007/annals.2008.167.481
[417] B. Green and T.C. Tao: New bounds for Szemerédi’s theorem. I. Progressions of length 4 in finite field geometries. Proc. London Math. Soc. (3) 98 (2) (2009), 365-392. · Zbl 1180.11006
[418] B. Green and T.C. Tao: An arithmetic regularity lemma, an associated counting lemma, and applications. In: I. Bárány, J. Solymosi (eds.) An Irregular Mind. Bolyai Soc. Math. Stud., Vol. 21, pp. 261-334. János Bolyai Mathematical Society, Budapest (2010) · Zbl 1222.11015
[419] B. Green and T.C. Tao: New bounds for Szemerédi’s theorem, III: a polylogarithmic bound for \(r_4(N)\). Mathematika 63 (3) (2017) 944-1040. · Zbl 1434.11037 · doi:10.1112/S0025579317000316
[420] B. Green and Julia Wolf: A note on Elkin’s improvement of Behrend’s construction. Additive number theory, 141-144, Springer, New York, 2010. arXiv:0810.0732. · Zbl 1261.11013
[421] Jerrold R. Griggs, M. Simonovits, and G. Rubin Thomas: Extremal graphs with bounded densities of small graphs, J. Graph Theory 29 (1998), 185-207. · Zbl 0919.05031
[422] Andrey Grinshpun and G.N. Sárközy: Monochromatic bounded degree subgraph partitions, Discrete Math. 339 (2016) 46-53. · Zbl 1322.05113
[423] Andrzei Grzesik: On the maximum number of five-cycles in a triangle-free graph, J. Combin. Theory Ser. B 102 (5) (2012) 1061-1066. arXiv:1102.0962. · Zbl 1252.05093 · doi:10.1016/j.jctb.2012.04.001
[424] A. Gyárfás: Covering complete graphs by monochromatic paths, in: Irregularities of Partitions, in: Algorithms Combin., 8 (1989), Springer-Verlag, pp. 89-91. · Zbl 0736.05062
[425] A. Gyárfás: Packing trees into \(n\)-chromatic graphs. Discuss. Math. Graph Theory 34 (1) (2014), 199-201. · Zbl 1292.05213 · doi:10.7151/dmgt.1735
[426] A. Gyárfás: Vertex covers by monochromatic pieces-a survey of results and problems. Discrete Math. 339 (7) (2016) 1970-1977. Arxiv 2015 · Zbl 1334.05085
[427] A. Gyárfás, E. Győri, and M. Simonovits: On 3-uniform hypergraphs without linear cycles. J. Combin. 7 (1) (2016), 205-216. · Zbl 1331.05162 · doi:10.4310/JOC.2016.v7.n1.a8
[428] A. Gyárfás, G.N. Sárközy, and E. Szemerédi: Long monochromatic Berge cycles in colored 4-uniform hypergraphs. Graphs Combin. 26 (1) (2010) 71-76. · Zbl 1221.05141 · doi:10.1007/s00373-010-0908-y
[429] A. Gyárfás and J. Lehel: Packing trees of different order into \(K_n\), in: Combinatorics, Proc. Fifth Hungarian Colloq., Keszthely, 1976, in: Colloq. Math. Soc. János Bolyai, vol. 18, North-Holland, Amsterdam-New York, (1978), pp. 463-469, · Zbl 0389.05030
[430] A. Gyárfás, J. Lehel, G. Sárközy, and R. Schelp: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, J. Combin. Theory Ser. B 98 (2008) 342-358. · Zbl 1140.05028 · doi:10.1016/j.jctb.2007.07.002
[431] A. Gyárfás, M. Ruszinkó, G.N. Sárközy, and E. Szemerédi: An improved bound for the monochromatic cycle partition number. J. Combin. Theory Ser. B 96(6) (2006) 855-873. · Zbl 1115.05031 · doi:10.1016/j.jctb.2006.02.007
[432] A. Gyárfás, M. Ruszinkó, G.N. Sárközy, and E. Szemerédi: Three-color Ramsey number for paths, Combinatorica 28(4) (2008), 499-502; Corrigendum: “Three-color Ramsey numbers for paths” [Combinatorica 27 (1) (2007) 35-69]. · Zbl 1175.05093
[433] A. Gyárfás and G.N. Sárközy: The 3-colour Ramsey number of a 3-uniform Berge cycle. Combin. Probab. Comput. 20 (1) (2011) 53-71. · Zbl 1215.05111 · doi:10.1017/S0963548310000209
[434] A. Gyárfás and G.N. Sárközy: Monochromatic path and cycle partitions in hypergraphs, Electronic Journal of Combinatorics, 20 (1) (2013) #P18. · Zbl 1266.05091
[435] A. Gyárfás and G.N. Sárközy: Monochromatic loose-cycle partitions in hypergraphs, Electronic J. of Combinatorics21 (2) (2014) P2.36. · Zbl 1300.05199
[436] A. Gyárfás, G.N. Sárközy, and Stanley M. Selkow: Coverings by few monochromatic pieces: a transition between two Ramsey problems. Graphs Combin. 31 (1) (2015), 131-140. · Zbl 1306.05149
[437] A. Gyárfás, G.N. Sárközy, and E. Szemerédi: The Ramsey number of diamond-matchings and loose cycles in hypergraphs. Electron. J. Combin. 15 (1) (2008), Research Paper 126, 14 pp. · Zbl 1165.05334
[438] A. Gyárfás, G.N. Sárközy, and E. Szemerédi: Stability of the path-path Ramsey number. Discrete Math. 309 (13) (2009), 4590-4595. · Zbl 1192.05091 · doi:10.1016/j.disc.2009.02.025
[439] A. Gyárfás, G.N. Sárközy, and E. Szemerédi: Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. J. Graph Theory 63 (4) (2010), 288-299. · Zbl 1223.05164
[440] Ervin Győri: On the number of \(C_5\) in a triangle-free graph, Combinatorica 9 (1989) 101-102. · Zbl 0679.05042 · doi:10.1007/BF02122689
[441] E. Győri: \(C_6\)-free bipartite graphs and product representation of squares, Discrete Math. 165/166 (1997) 371-375. · Zbl 0873.05058 · doi:10.1016/S0012-365X(96)00184-7
[442] E. Győri and Hao Li: On the number of triangles in \(C_{2k+1}\)-free graphs, Comb. Prob. Comput. 21 (1-2) (2013) 187-191. · Zbl 1238.05145
[443] E. Győri, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, and Máté Vizer: On the Turán number of some ordered even cycles. European J. Combin. 73 (2018), 81-88. · Zbl 1393.05163 · doi:10.1016/j.ejc.2018.05.008
[444] András Hajnal and E. Szemerédi: Proof of a conjecture of Erdős, Combinatorial Theory and its Applications vol. II (P. Erdős, A. Rényi and V.T. Sós eds.), Colloq. Math. Soc. J. Bolyai 4, North-Holland, Amsterdam (1970), pp. 601-623. · Zbl 0217.02601
[445] Péter Hajnal: An \(\Omega (n^{4/3})\) lower bound on the randomized complexity of graph properties, Combinatorica 11(2) (1991) 131-143.) · Zbl 0743.68076
[446] P. Hajnal, Simao Herdade, and E. Szemerédi: Proof of the Pósa-Seymour conjecture (2018), Arxiv
[447] P. Hajnal and M. Szegedy: (1992) On packing bipartite graphs. Combinatorica 12 295-301. · Zbl 0772.05079 · doi:10.1007/BF01285818
[448] P. Hajnal and E. Szemerédi: Two Geometrical Applications of the Semi-random Method, Chapter 8 in G. Ambrus et al. (eds.), New Trends in Intuitive Geometry, Bolyai Society Mathematical Studies 27 (2018). · Zbl 1414.05210
[449] Hiep Hàn, Y. Person, and M. Schacht: On perfect matchings in uniform hypergraphs with large minimum vertex degree. SIAM J. Discrete Math. 23 (2) (2009), 732-748 · Zbl 1191.05074
[450] H. Hàn and M. Schacht: Dirac-type results for loose Hamilton cycles in uniform hypergraphs, J. Combin. Theory Ser. B 100 (3) (2010) 332-346. · Zbl 1209.05161 · doi:10.1016/j.jctb.2009.10.002
[451] Jie Han and Yi Zhao: Minimum vertex degree threshold for \(C_4^3\)-tiling. J. Graph Theory 79 (2015) 300-317. · Zbl 1317.05149 · doi:10.1002/jgt.21833
[452] Christoph Hundack, Hans Jürgen Prömel, and Angelika Steger: Extremal graph problems for graphs with a color-critical vertex. Combin. Probab. Comput. 2 (4) (1993) 465-477. · Zbl 0793.05087 · doi:10.1017/S0963548300000833
[453] Hamed Hatami, Jan Hladký, Daniel Král’, Serguei Norine, and Alexander A. Razborov: On the number of pentagons in triangle-free graphs. J. Combin. Theory Ser. A 120 (2013) 722-732. · Zbl 1259.05087 · doi:10.1016/j.jcta.2012.12.008
[454] Julie Haviland and A.G. Thomason: Pseudo-random hypergraphs, in “Graph Theory and Combinatorics (Cambridge, 1988)” Discrete Math. 75 (1-3) (1989), 255-278. · Zbl 0800.05009
[455] J. Haviland and A.G. Thomason: On testing the “pseudo-randomness” of a hypergraph, Discrete Math. 103 (3) (1992), 321-327. · Zbl 0774.05071 · doi:10.1016/0012-365X(92)90324-9
[456] Penny E. Haxell: Partitioning complete bipartite graphs by monochromatic cycles, Journal of Combinatorial Theory, Ser. B 69 (1997) pp. 210-218. · Zbl 0867.05022
[457] P.E. Haxell: Tree embeddings, J. Graph Theory, 36 (2001), 121-130. · Zbl 0967.05029 · doi:10.1002/1097-0118(200103)36:3<121::AID-JGT1000>3.0.CO;2-U
[458] P.E. Haxell, T. Łuczak, Yuejian Peng, V. Rödl, A. Ruciński, M. Simonovits, and J. Skokan: The Ramsey number for hypergraph cycles I, J. Combin. Theory Ser. A 113 (2006) 67-83. · Zbl 1089.05053
[459] P.E. Haxell, T. Łuczak, Y. Peng, V. Rödl, A. Ruciński, and J. Skokan: The Ramsey number for 3-uniform tight hypergraph cycles. Combin. Probab. Comput. 18 (1-2) (2009) 165-203. · Zbl 1216.05093 · doi:10.1017/S096354830800967X
[460] Teresa Haynes, Michael Henning, Lucas C. van der Merwe, and Anders Yeo: Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey, J. Comb. Optim. 30 (3) (2015) 579-595. · Zbl 1325.05064 · doi:10.1007/s10878-013-9651-7
[461] R. Häggkvist and C. Thomassen: On pancyclic digraphs, J. Combin. Theory Ser. B 20 (1976) 20-40. · Zbl 0284.05110 · doi:10.1016/0095-8956(76)90063-0
[462] D.R. Heath-Brown: Integer sets containing no arithmetic progressions, J. London Math. Soc. 35 (1987), 385-394. · Zbl 0589.10062 · doi:10.1112/jlms/s2-35.3.385
[463] Anthony J.W. Hilton and Eric C. Milner: Some intersection theorems for systems of finite sets, Quart. J. Math. Oxf. 2 18 (1967) 369-384. · Zbl 0168.26205
[464] Neil Hindman: On a conjecture of Erdős, Faber, and Lovász about \(n\)-colorings. Canad. J. Math. 33 (3) (1981), 563-570. · Zbl 0476.05009 · doi:10.4153/CJM-1981-046-9
[465] Jan Hladký, J. Komlós, D. Piguet, M. Simonovits, Maya Stein, and E. Szemerédi: An approximate version of the Loebl-Komlós-Sós Conjecture for sparse graphs, arXiv:1211.3050.v1 (2012) Nov 13. · Zbl 1365.05141
[466] J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. Stein, and E. Szemerédi: The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition, SIAM J. Discrete Math., 31 (2017), 945-982, arXiv:1408.3858. · Zbl 1365.05141
[467] J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. Stein, and E. Szemerédi: The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs, SIAM J. Discrete Math., 31 (2017), 983-1016, · Zbl 1365.05142 · doi:10.1137/140982854
[468] J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. Stein, and E. Szemerédi: The approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS graphs, SIAM J. Discrete Math., 31 (2017), 1017-1071, · Zbl 1365.05143 · doi:10.1137/140982866
[469] J. Hladký, J. Komlós, D. Piguet, M. Simonovits, M. Stein, and E. Szemerédi: The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result. SIAM J. Discrete Math. 31 (2) (2017) 1072-1148. · Zbl 1365.05144 · doi:10.1137/140982878
[470] J. Hladký, D. Piguet, M. Simonovits, M. Stein, and E. Szemerédi: The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs, Electron. Res. Announc. Math. Sci., 22, (2015), 1-11. · Zbl 1332.05074
[471] J. Hladký and M. Schacht: Note on bipartite graph tilings. SIAM J. Discrete Math. 24 (2) (2010), 357-362. · Zbl 1213.05138 · doi:10.1137/080726434
[472] Alan J. Hoffman and Robert R. Singleton: Moore graphs with diameter 2 and 3, IBM Journal of Res. Develop. 4 (1960) 497-504. · Zbl 0096.38102 · doi:10.1147/rd.45.0497
[473] W. Imrich: Explicit construction of graphs without small cycles, Combinatorica 4 (1984), 53-59. · Zbl 0535.05033 · doi:10.1007/BF02579157
[474] B. Jackson and O. Ordaz: Chvátal-Erdős condition for path and cycles in graphs and digraphs. A survey, Discrete Math. 84 (1990), 241-254. · Zbl 0726.05043 · doi:10.1016/0012-365X(90)90130-A
[475] S. Janson: Quasi-random graphs and graph limits, European J. Combin. 32 (2011), 1054-1083. arXiv:0905.3241 · Zbl 1230.05262 · doi:10.1016/j.ejc.2011.03.011
[476] Svante Janson, Tomasz Łuczak, and A. Ruciński: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, (2000). xii+333 pp. · Zbl 0968.05003
[477] Janson, Svante and Sós, Vera T.: More on quasi-random graphs, subgraph counts and graph limits. European J. Combin. 46 (2015), 134-160. · Zbl 1307.05204 · doi:10.1016/j.ejc.2015.01.001
[478] S. Janson and A. Ruciński: The infamous upper tail. Probabilistic methods in combinatorial optimization. Random Structures and Algorithms 20 (3) (2002) 317-342. · Zbl 0996.60023
[479] Matthew Jenssen and J. Skokan: Exact Ramsey numbers of Odd cycles via nonlinear optimization, arXiv:1608.05705V1
[480] Anders Johansson, J. Kahn, and Van H. Vu: Factors in random graphs, Random Structures and Algorithms, 33 (2008), 1-28. · Zbl 1146.05040
[481] F. Joos, Jaehoon Kim, D. Kühn, and D. Osthus: Optimal packings of bounded degree trees. arXiv:1606.03953 (Submitted on 13 Jun 2016) · Zbl 1429.05164
[482] Jeff Kahn: Coloring nearly-disjoint hypergraphs with \(n+o(n)\) colors, J. Combin. Theory Ser. A 59 (1991) 31-39. · Zbl 0774.05073 · doi:10.1016/0097-3165(92)90096-D
[483] Jeff Kahn and Paul Seymour: A fractional version of the Erdős-Faber-Lovász conjecture. Combinatorica 12 (2) (1992), 155-160. · Zbl 0774.05072 · doi:10.1007/BF01204719
[484] Gil Kalai: Designs exist! [after Peter Keevash]. Astérisque No. 380, Séminaire Bourbaki. Vol. 2014/2015 (2016), Exp. No. 1100, 399-422. · Zbl 1470.05002
[485] Ravi Kannan: Markov chains and polynomial time algorithms. 35th Annual Symposium on Foundations of Computer Science (Santa Fe, NM, 1994), 656-671, IEEE Comput. Soc. Press, Los Alamitos, CA, 1994.
[486] Mikio Kano and Xueliang Li: Monochromatic and heterochromatic subgraphs in edge colored graphs - A Survey, Graphs and Combinatorics 24 (2008) 237-263. · Zbl 1190.05045
[487] Roman Karasev, Jan Kynčl, Pavel Paták, Zuzana Patáková, and Martin Tancer: Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete Comput. Geom. 54 (3) (2015), 610-636. · Zbl 1326.52022
[488] Gyula Katona: Graphs, vectors and inequalities in probability theory. (Hungarian) Mat. Lapok 20 (1969) 123-127. · Zbl 0188.23905
[489] G.O.H. Katona: Extremal problems for hypergraphs, in: M. Hall, J.H. van Lint (Eds.), Combinatorics Part II, in: Math. Centre Tracts, vol. 56 (1974), Mathematisch Centre Amsterdam, pp. 13-42. · Zbl 0298.05142
[490] G. Katona: Probabilistic inequalities from extremal graph results (a survey), Random Graphs ’83, Poznan, 1983, Ann. Discrete Math. 28 (1985) 159-170. · Zbl 0607.60017
[491] G.O.H. Katona: Turán’s graph theorem, measures and probability theory. Number theory, analysis, and combinatorics, 167-176, De Gruyter Proc. Math., De Gruyter, Berlin, (2014). · Zbl 1300.05143
[492] G.Y. Katona and H.A. Kierstead: Hamiltonian chains in hypergraphs. J. Graph Theory 30 (3) (1999) 205-212 · Zbl 0924.05050
[493] Gy. Katona, Tibor Nemetz, and M. Simonovits: On a graph problem of Turán, Mat. Fiz. Lapok 15 (1964) 228-238 (in Hungarian). · Zbl 0138.19402
[494] Peter Keevash: The Turán problem for projective geometries, J. Combin. Theory Ser. A, 111 (2005), 289-309. · Zbl 1070.05053 · doi:10.1016/j.jcta.2004.12.007
[495] P. Keevash: Shadows and intersections: stability and new proofs, Advances Math. 218 (5) (2008) 1685-1703. · Zbl 1160.05055 · doi:10.1016/j.aim.2008.03.023
[496] P. Keevash: A hypergraph regularity method for generalised Turán problems, Random Struct Algorithm 34 (2009), 123-164. · Zbl 1182.05125 · doi:10.1002/rsa.20249
[497] P. Keevash: A hypergraph blow-up lemma, Random Struct. Algorithms 39 (2011) 275-376. · Zbl 1232.05149
[498] P. Keevash: Hypergraph Turán problems, in: R. Chapman (Ed.), Surveys in Combinatorics, Cambridge Univ. Press, 2011, pp. 83-140. · Zbl 1244.05159
[499] P. Keevash and R. Mycroft: A multipartite Hajnal-Szemerédi theorem. The Seventh European Conference on Combinatorics, Graph Theory and Applications, 141-146, CRM Series, 16, Ed. Norm., Pisa, 2013. arXiv:1201.1882. · Zbl 1293.05298
[500] P. Keevash: The existence of designs, arXiv:1401.3665. (see also P. Keevash - “The existence of designs”, videotaped lectures https://www.youtube.com/watch?v=tN6oGXqS2Bs, 2015.)
[501] P. Keevash: The existence of designs, II. arXiv:1802.05900. · Zbl 1386.05015
[502] P. Keevash: Counting designs. J. Eur. Math. Soc. (JEMS) 20 (4) (2018), 903-927. arXiv:1504.02909. · Zbl 1386.05015
[503] P. Keevash and Dhruv Mubayi: Stability theorems for cancellative hypergraphs. J. Combin. Theory Ser. B 92 (1) (2004), 163-175. · Zbl 1052.05051
[504] P. Keevash and B. Sudakov: The Turán number of the Fano plane. Combinatorica 25 (5) (2005) 561-574. · Zbl 1089.05074 · doi:10.1007/s00493-005-0034-2
[505] P. Keevash and B. Sudakov: Triangle packings and 1-factors in oriented graphs. J. Combin. Theory Ser. B 99 (4) (2009) 709-727. arXiv:0806.2027 · Zbl 1208.05038 · doi:10.1016/j.jctb.2008.12.004
[506] P. Keevash and B. Sudakov: Pancyclicity of Hamiltonian and highly connected graphs. J. Combin. Theory Ser. B 100 (5) (2010), 456-467. · Zbl 1208.05071 · doi:10.1016/j.jctb.2010.02.001
[507] Imdadullah Khan: Perfect matchings in 3-uniform hypergraphs with large vertex degree. SIAM J. Discrete Math. 27 (2) (2013) 1021-1039 arXiv:1101.5830. · Zbl 1272.05160 · doi:10.1137/10080796X
[508] I. Khan: Perfect matchings in 4-uniform hypergraphs. J. Combin. Theory Ser. B 116 (2016), 333-366. arXiv:1101.5675 · Zbl 1327.05274 · doi:10.1016/j.jctb.2015.09.005
[509] Henry A. Kierstead and A.V. Kostochka: An Ore-type theorem on equitable coloring, J. Combinatorial Theory Series B 98 (2008), 226-234. · Zbl 1127.05039
[510] H.A. Kierstead and A.V. Kostochka: A short proof of the Hajnal-Szemerédi Theorem on equitable coloring, Combinatorics, Probability and Computing 17 (2008), 265-270. · Zbl 1163.05015 · doi:10.1017/S0963548307008619
[511] H.A. Kierstead and A.V. Kostochka: Ore-type versions of Brooks’ theorem. J. Combin. Theory Ser. B 99 (2) (2009) 298-305. · Zbl 1198.05059
[512] H.A. Kierstead, A.V. Kostochka, T. Molla, and Elyse C. Yeager: Sharpening an Ore-type version of the Corrádi-Hajnal theorem. Abh. Math. Semin. Univ. Hambg. 87 (2) (2017) 299-335. (Reviewer: Colton Magnant) · Zbl 1462.05143
[513] H.A. Kierstead, A.V. Kostochka, M. Mydlarz, and E. Szemerédi: A fast algorithm for equitable coloring. Combinatorica 30 (2) (2010) 217-224. · Zbl 1224.05176
[514] H.A. Kierstead, A.V. Kostochka and Gexin Yu: Extremal graph packing problems: Ore-type versus Dirac-type. In Surveys in Combinatorics 2009 Vol. 365 of London Mathematical Society Lecture Note Series, Cambridge Univ. Press, 113-136. · Zbl 1182.05064
[515] Jeong Han Kim: The Ramsey number \(R(3,t)\) has order of magnitude \(t^2/\log t\). Random Struct. Algorithms 7 (3) (1995) 173-207. · Zbl 0832.05084 · doi:10.1002/rsa.3240070302
[516] Jaehoon Kim, Younjin Kim, and Hong Liu: Two conjectures in Ramsey-Turán theory, SIAM J. Discrete Math. 33 (1) (2019) 564-586. arXiv:1803.04721. · Zbl 1407.05235
[517] Valerie King: “Lower bounds on the complexity of graph properties,” In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, Chicago, IL, 1988, pp. 468-476.
[518] V. King: A Lower Bound for the Recognition of Digraph Properties. Combinatorica, 1990, 10: 53-59 · Zbl 0733.05041 · doi:10.1007/BF02122695
[519] D.J. Kleitman and B.L. Rothschild: The number of finite topologies, Proc Amer Math. Soc. 25 (2) (1970), 276-282. · Zbl 0197.18802 · doi:10.1090/S0002-9939-1970-0253944-9
[520] Daniel J. Kleitman and B.L. Rothschild: Asymptotic enumeration of partial orders on a finite set, Trans Amer Math. Soc. 205 (1975), 205-220. · Zbl 0302.05007
[521] D.J. Kleitman, B.L. Rothschild, and J.H. Spencer: The number of semigroups of order \(n\). Proc. Amer. Math. Soc. 55 (1) (1976) 227-232. · Zbl 0324.05010
[522] D.J. Kleitman and David B. Wilson: On the number of graphs which lack small cycles, preprint, 1997.
[523] D.J. Kleitman and Kenneth J. Winston: On the number of graphs without 4-cycles, Discrete Math. 41 (2) (1982) 167-172. · Zbl 0491.05035
[524] Yoshiharu Kohayakawa: Szemerédi’s regularity lemma for sparse graphs, in Foundations of Computational Mathematics (Rio de Janeiro, 1997), Springer, Berlin, 1997, pp. 216-230. · Zbl 0868.05042
[525] Y. Kohayakawa, T. Łuczak, and V. Rödl: On \(K_4\)-free subgraphs of random graphs. Combinatorica 17 (2) (1997), 173-213. · Zbl 0889.05068
[526] Y. Kohayakawa; Guilherme Oliveira Mota, and M. Schacht; A. Taraz: Counting results for sparse pseudorandom hypergraphs II. European J. Combin. 65 (2017), 288-301. · Zbl 1369.05156
[527] Y. Kohayakawa, B. Nagle, V. Rödl, and M. Schacht: Weak hypergraph regularity and linear hypergraphs, Journal of Combinatorial Theory. Series B 100 (2010), 151-160. · Zbl 1216.05094 · doi:10.1016/j.jctb.2009.05.005
[528] Y. Kohayakawa and V. Rödl: Szemerédi’s regularity lemma and quasi-randomness, in: Recent Advances in Algorithms and Combinatorics, in: CMS Books Math./Ouvrages Math. SMC, vol. 11, Springer, New York, 2003, pp. 289-351. · Zbl 1023.05108
[529] Y. Kohayakawa, V. Rödl, M. Schacht, and J. Skokan: On the triangle removal lemma for subgraphs of sparse pseudorandom graphs, in: An Irregular Mind (Szemerédi is 70), in: Bolyai Soc. Math. Stud., vol. 21 (2010) Springer, Berlin, pp. 359-404. · Zbl 1213.05238
[530] Y. Kohayakawa, M. Simonovits, and J. Skokan: The 3-colored Ramsey number of odd cycles, Proceedings of GRACO2005, pp. 397-402 (electronic), Electron. Notes Discrete Math., 19, Elsevier, Amsterdam, (2005). · Zbl 1203.05100
[531] Phokion G. Kolaitis, Hans Jürgen Prömel, and B.L. Rothschild: \(K_{\ell +1}\)-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc. 303 (2) (1987) 637-671. · Zbl 0641.05025
[532] János Kollár, L. Rónyai, and Tibor Szabó: Norm-graphs and bipartite Turán numbers. Combinatorica 16 (1996), 399-406. · Zbl 0858.05061 · doi:10.1007/BF01261323
[533] János Komlós: The Blow-up lemma, Combin. Probab. Comput. 8 (1999) 161-176. · Zbl 0927.05041 · doi:10.1017/S0963548398003502
[534] J. Komlós: Tiling Turán theorems, Combinatorica 20 (2000), 203-218. · Zbl 0949.05063 · doi:10.1007/s004930070020
[535] J. Komlós, János Pintz, and E. Szemerédi: On Heilbronn’s triangle problem. J. London Math. Soc. (2) 24 (3) (1981), 385-396. · Zbl 0483.52007
[536] J. Komlós, J. Pintz, and E. Szemerédi: A lower bound for Heilbronn’s problem. J. London Math. Soc. (2) 25 (1) (1982) 13-24. · Zbl 0483.52008
[537] J. Komlós, G.N. Sárközy, and E. Szemerédi: Proof of a packing conjecture of Bollobás, Combinatorics, Probability and Computing 4 (1995), 241-255. · Zbl 0842.05072 · doi:10.1017/S0963548300001620
[538] J. Komlós, G.N. Sárközy, and E. Szemerédi: On the square of a Hamiltonian cycle in dense graphs, Random Structures and Algorithms, 9, (1996), 193-211. · Zbl 0864.05063 · doi:10.1002/(SICI)1098-2418(199608/09)9:1/2<193::AID-RSA12>3.0.CO;2-P
[539] J. Komlós, G.N. Sárközy, and E. Szemerédi: Blow-up Lemma, Combinatorica, 17 (1) (1997), pp. 109-123. · Zbl 0880.05049 · doi:10.1007/BF01196135
[540] J. Komlós, G.N. Sárközy, and E. Szemerédi: On the Pósa-Seymour conjecture, Journal of Graph Theory 29 (1998) 167-176. · Zbl 0919.05042 · doi:10.1002/(SICI)1097-0118(199811)29:3<167::AID-JGT4>3.0.CO;2-O
[541] J. Komlós, G.N. Sárközy, and E. Szemerédi: An algorithmic version of the blow-up lemma, Random Structures and Algorithms 12 (3) (1998) 297-312. · Zbl 0917.05071 · doi:10.1002/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-Q
[542] J. Komlós, G.N. Sárközy and E. Szemerédi: Proof of the Seymour conjecture for large graphs, Annals of Combinatorics, 2, (1998), 43-60. · Zbl 0917.05043 · doi:10.1007/BF01626028
[543] J. Komlós, G.N. Sárközy, and E. Szemerédi: Proof of the Alon-Yuster conjecture. Combinatorics (Prague, 1998). Discrete Math. 235 (1-3) (2001) 255-269. · Zbl 0977.05106
[544] J. Komlós; G.N. Sárközy; E. Szemerédi: Spanning trees in dense graphs. Combin. Probab. Comput. 10 (5) (2001) 397-416. · Zbl 0998.05012
[545] J. Komlós, Ali Shokoufandeh, M. Simonovits, and E. Szemerédi: The regularity lemma and its applications in graph theory, in Theoretical Aspects of Computer Science (Tehran, 2000), Lecture Notes in Comput. Sci., 2292, Springer, Berlin, (2002), 84-112. · Zbl 1054.68103
[546] J. Komlós and M. Simonovits: Szemerédi’s regularity lemma and its applications in graph theory, in Combinatorics, Paul Erdős Is Eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud. 2, János Bolyai Math. Soc., Budapest, 1996, pp. 295-352. · Zbl 0851.05065
[547] Dániel Korándi, M. Krivelevich, and B. Sudakov: Decomposing random graphs into few cycles and edges. Combin. Probab. Comput. 24 (6) (2015) 857-872. · Zbl 1371.05150
[548] Alexander V. Kostochka: “A Class of Constructions for Turán’s (3,4)-Problem,” Combinatorica 2 (2) (1982) 187-192. · Zbl 0502.05046 · doi:10.1007/BF02579317
[549] A.V. Kostochka, D. Mubayi, and J. Verstraëte: Hypergraph Ramsey numbers: triangles versus cliques. J. Combin. Theory Ser. A 120 (7) (2013) 1491-1507. · Zbl 1314.05125 · doi:10.1016/j.jcta.2013.04.009
[550] A.V. Kostochka, K. Nakprasit, and S. Pemmaraju: On equitable coloring of \(d\)-degenerate graphs, SIAM J. Discrete Math. 19 (2005) 83-95. · Zbl 1082.05037 · doi:10.1137/S0895480103436505
[551] A.V. Kostochka, M.J. Pelsmajer, and Doug B. West: A list analogue of equitable coloring. J. Graph Theory 44 (3) (2003) 166-177. · Zbl 1031.05050
[552] A.V. Kostochka and Michael Stiebitz: A list version of Dirac’s theorem on the number of edges in colour-critical graphs. J. Graph Theory 39 (3) (2002), 165-177. · Zbl 1176.05027
[553] A.V. Kostochka and G. Yu: Ore-type graph packing problems, Combin. Probab. Comput., 16 (2007), pp. 167-169. · Zbl 1122.05081 · doi:10.1017/S0963548306007899
[554] Tamás Kővári, V.T. Sós, and P. Turán: On a problem of Zarankiewicz, Colloq Math. 3 (1954), 50-57. · Zbl 0055.00704
[555] Daniel Král’ and Oleg Pikhurko: Quasirandom permutations are characterized by 4-point densities. Geom. Funct. Anal. 23 (2) (2013) 570-579. · Zbl 1268.05006 · doi:10.1007/s00039-013-0216-9
[556] Michael Krivelevich: On the minimal number of edges in color-critical graphs, Combinatorica 17 (1997) 401-426. · Zbl 0902.05025 · doi:10.1007/BF01215921
[557] M. Krivelevich, Choongbum Lee, and B. Sudakov: Resilient pancyclicity of random and pseudorandom graphs. SIAM J. Discrete Math. 24 (1) (2010) 1-16. · Zbl 1215.05165
[558] M. Krivelevich and W. Samotij: Optimal packings of Hamilton cycles in sparse random graphs, SIAM J. Discrete Math. 26 (3) (2012) 964-982., · Zbl 1256.05194 · doi:10.1137/110849171
[559] M. Krivelevich and B. Sudakov: Pseudo-random graphs, in: More Sets, Graphs and Numbers, in: Bolyai Soc. Math. Stud., vol. 15 (2006) Springer, pp. 199-262. · Zbl 1098.05075
[560] D. Kühn and D. Osthus: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory Ser. B 96 (6) (2006) 767-821. · Zbl 1109.05065 · doi:10.1016/j.jctb.2006.02.004
[561] D. Kühn, D. Osthus: Matchings in hypergraphs of large minimum degree, J. Graph Theory 51 (2006) 269-280. · Zbl 1087.05041 · doi:10.1002/jgt.20139
[562] D. Kühn and D. Osthus: The minimum degree threshold for perfect graph packings, Combinatorica 29 (2009), 65-107. · Zbl 1517.05143
[563] D. Kühn and D. Osthus: Embedding large subgraphs into dense graphs. Surveys in combinatorics 2009, 137-167, London Math. Soc. Lecture Note Ser., 365 (2009), Cambridge Univ. Press, Cambridge. · Zbl 1182.05098
[564] D. Kühn and D. Osthus: Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments, Advances Math., 237 (2013), pp. 62-146. · Zbl 1261.05053
[565] D. Kühn and D. Osthus: Hamilton cycles in graphs and hypergraphs: an extremal perspective. Proceedings of the International Congress of Mathematicians 2014. Vol. IV, 381-406, Kyung Moon Sa, Seoul. · Zbl 1373.05100
[566] D. Kühn, D. Osthus, and A. Treglown: Matchings in 3-uniform hypergraphs. J. Combin. Theory Ser. B 103 (2) (2013) 291-305. arXiv:1009.1298. · Zbl 1262.05128
[567] Felix Lazebnik, Vasyl A. Ustimenko, and Andrew J. Woldar: Properties of certain families of \(2k\)-cycle-free graphs. J. Combin. Theory Ser. B 60 (2) (1994), 293-298. · Zbl 0803.05028
[568] F. Lazebnik, V.A. Ustimenko, and A.J. Woldar: A new series of dense graphs of high girth. Bull. Amer. Math. Soc. (N.S.) 32 (1) (1995) 73-79. · Zbl 0822.05039
[569] F. Lazebnik and A.J. Woldar: General properties of some families of graphs defined by systems of equations. J. Graph Theory 38 (2) (2001) 65-86. · Zbl 0990.05080
[570] Choongbum Lee and B. Sudakov: Hamiltonicity, independence number, and pancyclicity. European J. Combin. 33 (4) (2012) 449-457. · Zbl 1239.05106
[571] Hanno Lefmann: On Heilbronn’s problem in higher dimension. Combinatorica 23 (4) (2003), 669-680. · Zbl 1099.68124 · doi:10.1007/s00493-003-0040-1
[572] H. Lefmann, Y. Person, V. Rödl, and M. Schacht: On colourings of hypergraphs without monochromatic Fano planes, Combin. Probab. Comput., 18 (2009), pp. 803-818. · Zbl 1197.05053 · doi:10.1017/S0963548309009948
[573] H. Lefmann and Niels Schmitt: A deterministic polynomial-time algorithm for Heilbronn’s problem in three dimensions. SIAM J. Comput. 31 (6) (2002) 1926-1947. · Zbl 1008.68161
[574] Vsevolod F. Lev, T. Łuczak, and Tomasz Schoen: Sum-free sets in abelian groups, Israel Journal of Mathematics 125 (2001), 347-367. · Zbl 1055.20043 · doi:10.1007/BF02773386
[575] Ian Levitt, G.N. Sárközy, and E. Szemerédi: How to avoid using the regularity lemma: Pósa’s conjecture revisited, Discrete Math., 310 (2010), 630-641. · Zbl 1188.05080
[576] Allan Lo and Klas Markström: A multipartite version of the Hajnal-Szemerédi theorem for graphs and hypergraphs. Combin. Probab. Comput. 22 (1) (2013) 97-111. arXiv:1108.4184. · Zbl 1257.05130
[577] Allan Lo and K. Markström: Minimum codegree threshold for \((K_4^3-e)\)-factors. J. Combin. Theory Ser. A 120 (2013) 708-721. arXiv:1111.5334v1 · Zbl 1259.05123
[578] Allan Lo and K. Markström: Perfect matchings in 3-partite 3-uniform hypergraphs, J. Combin. Theory Ser. A 127 (2014) 22-57. arXiv:1103.5654. · Zbl 1300.05200
[579] Allan Lo and K. Markström: \(F\)-factors in hypergraphs via absorption. Graphs Combin. 31 (3) (2015), 679-712. arXiv:1105.3411v1 · Zbl 1312.05099
[580] Po-Shen Loh and Jie Ma: Diameter critical graphs. J. Combin. Theory Ser. B 117 (2016) 34-58. · Zbl 1329.05097 · doi:10.1016/j.jctb.2015.11.004
[581] László Lovász: On covering of graphs. Theory of Graphs (Proc. Colloq., Tihany, 1966) pp. 231-236 (1967) Academic Press, New York · Zbl 0157.31202
[582] L. Lovász: On chromatic number of finite set-systems, Acta Math. Acad. Sci. Hungar. 19 (1968) 59-67. · Zbl 0157.55203 · doi:10.1007/BF01894680
[583] L. Lovász: The factorization of graphs. Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969) pp. 243-246 Gordon and Breach, New York (1970). · Zbl 0257.05122
[584] L. Lovász: Subgraphs with prescribed valencies. J. Combinatorial Theory 8 (1970) 391-416. · Zbl 0198.29201 · doi:10.1016/S0021-9800(70)80033-3
[585] L. Lovász: On the sieve formula. (Hungarian) Mat. Lapok 23 (1972), 53-69 (1973). · Zbl 0293.05002
[586] L. Lovász: Independent sets in critical chromatic graphs, Stud. Sci. Math. Hung. 8 (1973) 165-168. · Zbl 0285.05117
[587] L. Lovász: Chromatic number of hypergraphs and linear algebra. Studia Sci. Math. Hungar. 11 (1-2) (1976) 113-114 (1978). · Zbl 0425.05026
[588] L. Lovász: On the Shannon capacity of a graph, IEEE Transactions on Information Theory 25 (1979) 1-7. · Zbl 0395.94021
[589] L. Lovász: Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest. North-Holland Publishing Co., Amsterdam-New York, (1979). 551 pp. 2nd Edition, American Mathematical Society, Providence, Rhode Island, 2007. · Zbl 0439.05001
[590] L. Lovász: Very large graphs. Current developments in mathematics, (2008) 67-128, Int. Press, Somerville, MA, 2009. · Zbl 1179.05100
[591] L. Lovász: Large networks and graph limits. American Mathematical Society Colloquium Publications, 60. American Mathematical Society, Providence, RI, (2012) xiv+475 pp. · Zbl 1292.05001
[592] L. Lovász and M. Simonovits: On the number of complete subgraphs of a graph, in Proc. 5th British Combinatorial Conference, Aberdeen 1975. Congress. Numer. XV(1976) 431-441. · Zbl 0339.05115
[593] L. Lovász and M. Simonovits: On the number of complete subgraphs of a graph II, Studies in Pure Math. (dedicated to P. Turán) (1983) 459-495 Akadémiai Kiadó+Birkhäuser Verlag. · Zbl 0519.05042
[594] L. Lovász and V.T. Sós: Generalized quasirandom graphs, J. Combin. Theory Ser B 98 (2008), 146-163. · Zbl 1127.05094 · doi:10.1016/j.jctb.2007.06.005
[595] L. Lovász and B. Szegedy: Szemerédi’s lemma for the analyst. Geom. Funct. Anal. 17 (1) (2007) 252-270. · Zbl 1123.46020 · doi:10.1007/s00039-007-0599-6
[596] L. Lovász and B. Szegedy: Testing properties of graphs and functions. Israel J. Math. 178 (2010), 113-156. arXiv:0803.1248. · Zbl 1246.05106
[597] Alex Lubotzky: Discrete Groups, Expanding Graphs and Invariant Measures. Progr. Math. 125 (1994) Birkhäuser, Basel (1994) · Zbl 0826.22012
[598] A. Lubotzky, Ralph Phillips, and P. Sarnak: Ramanujan Conjecture and explicit construction of expanders (Extended Abstract), Proceedings of the STOC (1986), pp. 240-246.
[599] A. Lubotzky, R. Phillips, and P. Sarnak: Ramanujan graphs, Combinatorica 8 (1988), 261-277. · Zbl 0661.05035 · doi:10.1007/BF02126799
[600] Tomasz J. Łuczak: \(R({C_n},{C_n},{C_n} )\le (4+o(1))n\), Journal of Combinatorial Theory, Ser. B 75 (2) (1999) 174-187. · Zbl 0934.05091
[601] T. Łuczak: On triangle-free random graphs, Random Struct. Algorithms 16 (3) (2000), 260-276. · Zbl 0947.05071 · doi:10.1002/(SICI)1098-2418(200005)16:3<260::AID-RSA3>3.0.CO;2-Q
[602] T. Łuczak, V. Rödl, and E. Szemerédi: Partitioning two-colored complete graphs into two monochromatic cycles, Combinatorics, Probability and Computing, 7 (1998) pp. 423-436. · Zbl 0916.05025 · doi:10.1017/S0963548398003599
[603] T. Łuczak and T. Schoen: On the maximal density of sum-free sets. Acta Arith. 95 (3) (2000) 225-229. · Zbl 0962.11013 · doi:10.4064/aa-95-3-225-229
[604] T. Łuczak and T. Schoen: On the number of maximal sum-free sets, Proc. Amer. Math. Soc. 129 (2001) 2205-2207. · Zbl 1056.11011 · doi:10.1090/S0002-9939-00-05815-9
[605] Clara Lüders and C. Reiher: The Ramsey-Turán problem for cliques, Isr. J. Math. 232 (2) (2019), 613-652. · Zbl 1410.05218
[606] W. Mantel: Problem 28 (solution by H. Gouwentak, W. Mantel, J. Texeira de Mattes, F. Schuh and W. A. Wythoff), Wiskundige Opgaven 10 (1907), 60-61. · JFM 38.0270.01
[607] Gregory A. Margulis: Explicit constructions of expanders. (Russian) Problemy Peredači Informacii 9 (4) (1973), 71-80. English transl.: Problems Inform. Transmission 9 (1975) 325-332.
[608] G.A. Margulis: Explicit constructions of graphs without short cycles and low density codes, Combinatorica 2 (1982), 71-78. · Zbl 0492.05044 · doi:10.1007/BF02579283
[609] G.A. Margulis: Arithmetic groups and graphs without short cycles, 6th Internat. Symp. on Information Theory, Tashkent 1984, Abstracts, Vol. 1, pp. 123-125 (in Russian).
[610] G.A. Margulis: Some new constructions of low-density paritycheck codes. 3rd Internat. Seminar on Information Theory, convolution codes and multi-user communication, Sochi 1987, pp. 275-279 (in Russian).
[611] G.A. Margulis: Explicit group theoretic constructions of combinatorial schemes and their applications for the construction of expanders and concentrators, Journal of Problems of Information Transmission, 24 (1988) 39-46, (in Russian). · Zbl 0708.05030
[612] K. Markström and A. Ruciński: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. European J. Combin. 32 (5) (2011), 677-687 · Zbl 1229.05231 · doi:10.1016/j.ejc.2011.02.001
[613] Ryan Martin and E. Szemerédi: Quadripartite version of the Hajnal-Szemerédi theorem. Discrete Math. 308 (19) (2008), (special edition in honor of Miklós Simonovits), 4337-4360. · Zbl 1152.05037
[614] Michael Molloy: The Probabilistic Method. Book chapter in “Probabilistic Methods for Algorithmic Discrete Mathematics”, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, editors. pp. 1-35. Springer, 1998. · Zbl 0918.05092
[615] M. Molloy and Bruce Reed: Graph colouring and the probabilistic method, Algorithms and Combinatorics, vol. 23 (2002), Springer-Verlag, Berlin. · Zbl 0987.05002
[616] Richard Montgomery: Embedding Bounded Degree Spanning Trees in Random Graphs, preprint, https://arxiv.org/abs/1405.6559, 2014.
[617] John W. Moon and Leo Moser: On a problem of Turán. Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962) 283-286. · Zbl 0114.01206
[618] Robert Morris and David Saxton: The number of \(C_{2\ell }\)-free graphs, Advances in Mathematics 298 (2016), 534-580. arXiv:1309.2927. · Zbl 1339.05199 · doi:10.1016/j.aim.2016.05.001
[619] Robin A. Moser: Derandomizing the Lovász local lemma more effectively. (2008) Eprint arXiv:0807.2120v2.
[620] R.A. Moser and Gábor Tardos: A constructive proof of the general Lovász local lemma. J. ACM 57 (2) (2010), Art. 11, 15 pp. · Zbl 1300.60024
[621] Guy Moshkovitz and A. Shapira: A short proof of Gowers’ lower bound for the regularity lemma. Combinatorica 36 (2016) 187-194. · Zbl 1399.05128
[622] Dhruv Mubayi: The co-degree density of the Fano plane, J. Combin. Theory Ser. B 95 (2) (2005) 333-337. · Zbl 1075.05063 · doi:10.1016/j.jctb.2005.06.001
[623] D. Mubayi: Structure and stability of triangle-free set systems, Trans. Amer. Math. Soc., 359 (2007), 275-291. · Zbl 1129.05054 · doi:10.1090/S0002-9947-06-04009-8
[624] D. Mubayi: Counting substructures I: color critical graphs, Advances Math. 225 (5) (2010) 2731-2740. · Zbl 1210.05047 · doi:10.1016/j.aim.2010.05.013
[625] D. Mubayi and O. Pikhurko: A new generalization of Mantel’s theorem to \(k\)-graphs. J. Combin. Theory Ser. B 97 (4) (2007), 669-678. · Zbl 1153.05032 · doi:10.1016/j.jctb.2006.11.003
[626] D. Mubayi and V.T. Sós: Explicit constructions of triple systems for Ramsey-Turán problems. J. Graph Theory 52 (3) (2006), 211-216. · Zbl 1098.05055 · doi:10.1002/jgt.20156
[627] Marcello Mydlarz and E. Szemerédi: Algorithmic Brooks’ theorem, 2007, manuscript.
[628] Brendan Nagle and V. Rödl: The asymptotic number of triple systems not containing a fixed one, in: Combinatorics, Prague, 1998, Discrete Math. 235 (2001) 271-290. · Zbl 0977.05018
[629] B. Nagle, V. Rödl, and M. Schacht: An algorithmic hypergraph regularity lemma. Random Structures Algorithms 52 (2) (2018), 301-353. · Zbl 1388.05131 · doi:10.1002/rsa.20739
[630] Jarik Nešetřil and V. Rödl: A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Combin. Theory Ser. B 27 (2) (1979), 225-227. · Zbl 0413.05039
[631] Rajko Nenadov, B. Sudakov, and Mykhaylo Tyomkyn: Proof of the Brown-Erdős-Sós conjecture in groups, arXiv:1902.07614
[632] Vladimir Nikiforov: The number of cliques in graphs of given order and size. Trans. Amer. Math. Soc. 363 (2011) 1599-1618. arXiv:0710.2305v2 · Zbl 1231.05129
[633] V. Nikiforov and R.H. Schelp: Cycles and stability, J. Combin. Theory Ser. B 98 (2008) 69-84. · Zbl 1129.05023 · doi:10.1016/j.jctb.2007.05.001
[634] S. Norin and L. Yepremyan: Turán number of generalized triangles. J. Combin. Theory Ser. A 146 (2017), 312-343. · Zbl 1351.05163 · doi:10.1016/j.jcta.2016.09.003
[635] Oystein Ore: Note on Hamilton circuits, Amer. Math. Monthly 67 (1960) 55. · Zbl 0089.39505 · doi:10.2307/2308928
[636] Deryk Osthus, H.J. Prömel, and A. Taraz: ‘For which densities are random triangle-free graphs almost surely bipartite?’, Combinatorica 23 (2003), 105-150. · Zbl 1047.05040
[637] János Pach: A Tverberg-type result on multicolored simplices. Comput. Geom. 10 (2) (1998) 71-76. · Zbl 0896.68143 · doi:10.1016/S0925-7721(97)00022-9
[638] J. Pach: Geometric intersection patterns and the theory of topological graphs. Proceedings of the International Congress of Mathematicians-Seoul 2014. Vol. IV, 455-474, Kyung Moon Sa, Seoul, (2014). · Zbl 1373.05095
[639] J. Pach and Pankaj K. Agarwal: Combinatorial geometry. Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, (1995). xiv+354 pp. · Zbl 0881.52001
[640] Pach, János:; Sharir, Micha: On the number of incidences between points and curves. Combin. Probab. Comput. 7 (1) (1998) 121-127. · Zbl 0901.52016
[641] J. Pach and József Solymosi: Crossing patterns of segments, Journal of Combinatorial Theory, Ser. A 96 (2001), 316-325. · Zbl 0989.05031
[642] Balázs Patkós: Supersaturation and stability for forbidden subposet problems, J. Combin. Theory Ser. A 136 (2015) 220-237. · Zbl 1322.06002 · doi:10.1016/j.jcta.2015.07.004
[643] Michael S. Payne and David R. Wood: On the general position subset selection problem, SIAM J. Discrete Math., 27 (4) (2013), 1727-1733. arXiv:1208.5289.v2 · Zbl 1348.52012
[644] Y. Peng and C. Zhao: Generating non-jumping numbers recursively, Discrete Applied Mathematics 156 (2008), 1856-1864. · Zbl 1185.05109 · doi:10.1016/j.dam.2007.09.003
[645] Yury Person and M. Schacht: Almost all hypergraphs without Fano planes are bipartite, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 2009, pp. 217-226. · Zbl 1423.05114
[646] Oleg Pikhurko: An exact Turán result for the generalized triangle, Combinatorica 28 (2008), 187-208. · Zbl 1175.05137 · doi:10.1007/s00493-008-2187-2
[647] O. Pikhurko: Perfect matchings and \(K^3_4\)-tilings in hypergraphs of large codegree, Graphs Combin. 24 (4) (2008) 391-404. · Zbl 1205.05184 · doi:10.1007/s00373-008-0787-7
[648] O. Pikhurko: On possible Turán densities. Israel J. Math. 201 (1) (2014), 415-454. arXiv:1204.4423 · Zbl 1302.05097 · doi:10.1007/s11856-014-0031-5
[649] O. Pikhurko and Zelealem B. Yilma: Supersaturation problem for color-critical graphs. J. Combin. Theory Ser. B 123 (2017), 148-185. · Zbl 1354.05054
[650] Oleg Pikhurko and Alexandr Razborov: Asymptotic structure of graphs with the minimum number of triangles. Combin. Probab. Comput. 26 (1) (2017) 138-160. · Zbl 1371.05147 · doi:10.1017/S0963548316000110
[651] Mark S. Pinsker: On the complexity of a concentrator, in: Proc. of the 7th International Teletraffic Conference, 1973, pp. 318/1-318/4.
[652] Nick Pippenger and J. Spencer: Asymptotic behavior of the chromatic index for hypergraphs, J. Combin. Theory Ser A 51 (1989), 24-42. · Zbl 0729.05038
[653] Ján Plesník: Critical graphs of given diameter. (Slovak, Russian summary) Acta Fac. Rerum Natur. Univ. Comenian. Math. 30 (1975), 71-93. · Zbl 0318.05115
[654] Alexey Pokrovskiy: Partitioning edge-coloured complete graphs into monochromatic cycles and paths, J. Combin. Theory Ser. B 106 (2014) 70-97. arXiv:1205.5492v1. · Zbl 1300.05260
[655] D. H.J. Polymath, Density Hales-Jewett and Moser numbers, in An Irregular Mind: Szemerédi is 70, Springer-Verlag, New York, 2010, pp. 689-753. · Zbl 1239.05189 · doi:10.1007/978-3-642-14444-8_22
[656] D.H.J. Polymath: A new proof of the density Hales-Jewett theorem. Ann. of Math. (2) 175 (3) (2012), 1283-1327. · Zbl 1267.11010
[657] Carl Pomerance and A. Sárközy: Combinatorial number theory, Handbook of combinatorics, Vol. 1, 2, pp. 967-1018, Elsevier, Amsterdam, 1995. · Zbl 0849.11001
[658] Lajos Pósa: A theorem concerning Hamilton lines, Publ. Math. Inst. Hung. Acad. Sci. 7 (1962), 225-226. · Zbl 0114.40003
[659] L. Pósa: On the circuits of finite graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 8 (1963) 355-361 (1964) · Zbl 0133.16702
[660] L. Pósa: Hamiltonian circuits in random graphs, Discrete Math., 14 (1976), pp. 359-364. · Zbl 0322.05127 · doi:10.1016/0012-365X(76)90068-6
[661] H.J. Prömel and V. Rödl: Non-Ramsey graphs are \(c\log n\)-universal, J. Comb. Th. (A) 88 (1999) 378-384. · Zbl 0934.05090 · doi:10.1006/jcta.1999.2972
[662] Hans Jürgen Prömel and Angelika Steger: Excluding induced subgraphs: quadrilaterals, Random Structures and Algorithms 2 (1991) 55-71. · Zbl 0763.05046
[663] H.J. Prömel and A. Steger: A. Excluding induced subgraphs. III. A general asymptotic. Random Structures and Algorithms 3 (1) (1992) 19-31. · Zbl 0751.05041
[664] H.J. Prömel and A. Steger: Almost all Berge graphs are perfect, Combin. Probab. Comput. 1 (1992) 53-79. · Zbl 0793.05063 · doi:10.1017/S0963548300000079
[665] H.J. Prömel and A. Steger: ‘The asymptotic number of graphs not containing a fixed color-critical subgraph’, Combinatorica 12 (1992), 463-473. · Zbl 0770.05063 · doi:10.1007/BF01305238
[666] H.J. Prömel and A. Steger: On the asymptotic structure of sparse triangle free graphs, J. Graph Theory 21 (2) (1996), 137-151, · Zbl 0856.05037 · doi:10.1002/(SICI)1097-0118(199602)21:2<137::AID-JGT3>3.0.CO;2-S
[667] László Pyber: An Erdős-Gallai conjecture. Combinatorica 5 (1) (1985), 67-79. · Zbl 0581.05043
[668] L. Pyber: Covering the edges of a connected graph by paths, J. Comb. Theory B. (66) 1996, 52-159. · Zbl 0840.05071
[669] Alexander A. Razborov: Flag algebras. J. Symbolic Logic 72 (2007) 1239-1282. · Zbl 1146.03013 · doi:10.2178/jsl/1203350785
[670] A.A. Razborov: On the minimal density of triangles in graphs. Combinatorics, Probability and Computing, 17 (4) (2008) 603-618. · Zbl 1170.05036 · doi:10.1017/S0963548308009085
[671] A.A. Razborov: On 3-hypergraphs with forbidden 4-vertex configurations, SIAM J. Discrete Math. 24 (3) (2010) 946-963. · Zbl 1223.05204 · doi:10.1137/090747476
[672] A.A. Razborov: On the Fon-der-Flaass interpretation of extremal examples for Turán’s (3,4)-problem. Proceedings of the Steklov Institute of Mathematics 274 (2011), 247-266 Algoritmicheskie Voprosy Algebry i Logiki, 269-290; translation in Proc. Steklov Inst. Math. 274 (1) (2011), 247-266. · Zbl 1296.05099
[673] Christian Reiher: The clique density theorem, Ann. of Math. 184 (2016) 683-707. arXiv:1212.2454v1. · Zbl 1348.05103
[674] C. Reiher, V. Rödl, A. Ruciński, M. Schacht, and E. Szemerédi: Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs (2016) arXiv:1611.03118v1 · Zbl 1422.05077
[675] István Reiman: Über ein Problem von K. Zarankiewicz, Acta Math. Acad. Sci. Hungar. 9 (1958), 269-278. · Zbl 0084.01303
[676] D. Romero and A. Sánchez-Arroyo: “Advances on the Erdős-Faber-Lovász conjecture”, in G. Grimmet and C, McDiarmid, Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh, Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press, (2007) pp. 285-298.
[677] Vera Rosta: On a Ramsey-type problem of J.A. Bondy and P. Erdős. I, J. Combin. Theory Ser. 15 (1973) 94-104; and V. Rosta: On a Ramsey-type problem of J.A. Bondy and P. Erdős. II, J. Combin. Theory Ser. B 15 (1973) 105-120. · Zbl 0261.05119
[678] Klaus F. Roth: On a problem of Heilbronn, J. London Math. Soc.26 (1951), 198-204. · Zbl 0043.16303
[679] K.F. Roth: On certain sets of integers, J. London Math. Soc. 28 (1953), 104-109. · Zbl 0050.04002 · doi:10.1112/jlms/s1-28.1.104
[680] K.F. Roth: On a problem of Heilbronn II, Proc. London Math. Soc.25 (3) (1972), 193-212. · Zbl 0248.52013 · doi:10.1112/plms/s3-25.2.193
[681] K.F. Roth: On a problem of Heilbronn III, Proc. London Math. Soc.25 (3) (1972), 543-549. · Zbl 0253.52001 · doi:10.1112/plms/s3-25.3.543
[682] K.F. Roth: Estimation of the Area of the Smallest Triangle Obtained by Selecting Three out of \(n\) Points in a Disc of Unit Area, AMS, Providence, Proc. of Symposia in Pure Mathematics 24 (1973) 251-262. · Zbl 0264.52008 · doi:10.1090/pspum/024/0335445
[683] K.F. Roth: Developments in Heilbronn’s triangle problem, Advances in Math.22 (3) (1976), 364-385. · Zbl 0338.52005 · doi:10.1016/0001-8708(76)90100-6
[684] Vojtěch Rödl: On a packing and covering problem, European J. Combin. 6 (1985) 69-78. · Zbl 0565.05016 · doi:10.1016/S0195-6698(85)80023-8
[685] V. Rödl: Note on a Ramsey-Turán type problem, Graphs and Combin. 1 (3) (1985), 291-293. · Zbl 0589.05043 · doi:10.1007/BF02582954
[686] V. Rödl: Quasi-randomness and the regularity method in hypergraphs. Proceedings of the International Congress of Mathematicians-Seoul 2014. Vol. 1, 573-601, Kyung Moon Sa, Seoul, (2014). · Zbl 1373.05096
[687] V. Rödl, B. Nagle, J. Skokan, M. Schacht, and Y. Kohayakawa: The hypergraph regularity method and its applications, Proc. Natl. Acad. Sci. USA 102 (23) (2005) 8109-8113. · Zbl 1135.05307 · doi:10.1073/pnas.0502771102
[688] V. Rödl and A. Ruciński: Perfect matchings in \(\epsilon \)-regular graphs and the blow-up lemma, Combinatorica 19 (3) (1999) 437-452. · Zbl 0932.05080 · doi:10.1007/s004930050063
[689] V. Rödl and A. Ruciński: Dirac-type questions for hypergraphs – a survey (or more problems for Endre to solve). In: I. Bárány, J. Solymosi, G. Sági (eds.) An Irregular Mind, pp. 561-590. János Bolyai Math. Soc., Budapest (2010) · Zbl 1221.05255 · doi:10.1007/978-3-642-14444-8_16
[690] V. Rödl and A. Ruciński: Families of triples with high minimum degree are Hamiltonian. Discuss. Math. Graph Theory 34 (2) (2014), 361-381. · Zbl 1290.05114 · doi:10.7151/dmgt.1743
[691] V. Rödl, A. Ruciński, M. Schacht, and E. Szemerédi: A note on perfect matchings in uniform hypergraphs with large minimum collective degree. Comment. Math. Univ. Carolin. 49 (4) (2008) 633-636. · Zbl 1212.05215
[692] V. Rödl, A. Ruciński, M. Schacht, and E. Szemerédi: On the Hamiltonicity of triple systems with high minimum degree. Annales Comb. 21 (1) (2017), 95-117. · Zbl 1359.05089 · doi:10.1007/s00026-017-0345-1
[693] V. Rödl, A. Ruciński, and E. Szemerédi: Perfect matchings in uniform hypergraphs with large minimum degree, European J. Combin. 27 (8) (2006) 1333-1349. · Zbl 1104.05051 · doi:10.1016/j.ejc.2006.05.008
[694] V. Rödl, A. Ruciński, and E. Szemerédi: A Dirac-type theorem for 3-uniform hypergraphs, Combinatorics, Probability, and Computing 15 (1-2) (2006) 229-251. · Zbl 1082.05057 · doi:10.1017/S0963548305007042
[695] V. Rödl, A. Ruciński, and E. Szemerédi: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs. Combinatorica 28 (2) (2008) 229-260. · Zbl 1164.05051 · doi:10.1007/s00493-008-2295-z
[696] V. Rödl, A. Ruciński, and E. Szemerédi: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory Ser. A 116 (3) (2009) 613-636. · Zbl 1214.05130 · doi:10.1016/j.jcta.2008.10.002
[697] V. Rödl, A. Ruciński, and E. Szemerédi: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Advances Math. 227 (3) (2011), 1225-1299. arXiv:1611.03118. · Zbl 1220.05083
[698] V. Rödl, A. Ruciński, and A. Taraz: Hypergraph packing and graph embedding, Combinatorics, Probab. Comput. 8 (1999) 363-376. · Zbl 0938.05046 · doi:10.1017/S0963548399003879
[699] V. Rödl, A. Ruciński, and Michelle Wagner: An algorithmic embedding of graphs via perfect matchings. Randomization and approximation techniques in computer science (Barcelona, 1998), 25-34, Lecture Notes in Comput. Sci., 1518, Springer, Berlin, 1998. · Zbl 0927.05074
[700] V. Rödl, M. Schacht, E. Tengan and N. Tokushige: Density theorems and extremal hypergraph problems, Israel J. Math. 152 (2006), 371-380. · Zbl 1127.05055 · doi:10.1007/BF02771992
[701] V. Rödl and M. Schacht: Regular partitions of hypergraphs: Regularity lemmas, Combin. Probab. Comput. 16 (2007), 833-885. · Zbl 1206.05071 · doi:10.1017/S0963548307008553
[702] V. Rödl and M. Schacht: Generalizations of the removal lemma, Combinatorica 29 (4) (2009) 467-501. · Zbl 1212.05133 · doi:10.1007/s00493-009-2320-x
[703] V. Rödl and M. Schacht: Extremal results in random graphs, Erdős centennial, Bolyai Soc. Math. Stud., vol. 25, János Bolyai Math. Soc., Budapest, (2013), pp. 535-583, arXiv:1302.2248. · Zbl 1304.05125
[704] V. Rödl and Mark H. Siggers: Color critical hypergraphs with many edges, J. Graph Theory 53 (2006) 56-74. · Zbl 1098.05033
[705] V. Rödl and J. Skokan: Regularity lemma for \(k\)-uniform hypergraphs, Random Structures and Algorithms 25 (1) (2004) 1-42. · Zbl 1046.05042 · doi:10.1002/rsa.20017
[706] V. Rödl and J. Skokan: Applications of the regularity lemma for uniform hypergraphs, Random Structures and Algorithms 28 (2) (2006) 180-194. · Zbl 1087.05031 · doi:10.1002/rsa.20108
[707] V. Rödl and Zsolt Tuza: On color critical graphs. J. Combin. Theory Ser. B 38 (3) (1985), 204-213. · Zbl 0566.05030
[708] Imre Z. Ruzsa: Solving a linear equation in a set of integers. I, Acta Arith. 65 (3) (1993) 259-282. · Zbl 1042.11525 · doi:10.4064/aa-65-3-259-282
[709] I.Z. Ruzsa: Solving a linear equation in a set of integers II, Acta Arith. 72 (1995) 385-397. · Zbl 1044.11617 · doi:10.4064/aa-72-4-385-397
[710] I.Z. Ruzsa: An infinite Sidon sequence, J. Number Theory 68 (1998) 63-71. · Zbl 0927.11005 · doi:10.1006/jnth.1997.2192
[711] I.Z. Ruzsa and E. Szemerédi: Triple systems with no six points carrying three triangles. Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, pp. 939-945, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978. · Zbl 0393.05031
[712] Horst Sachs and Michael Stiebitz: Construction of colour-critical graphs with given major-vertex subgraph. Combinatorial mathematics (Marseille-Luminy, 1981), 581-598, North-Holland Math. Stud., 75, Ann. Discrete Math., 17(1983) North-Holland, Amsterdam. · Zbl 0532.05029
[713] H. Sachs and M. Stiebitz: Colour-critical graphs with vertices of low valency. Graph theory in memory of G.A. Dirac (Sandbjerg, 1985), 371-396, Ann. Discrete Math., 41, North-Holland, Amsterdam, 1989. · Zbl 0669.05035
[714] H. Sachs and M. Stiebitz: On constructive methods in the theory of colour-critical graphs. Graph colouring and variations. Discrete Math. 74 (1-2) (1989) 201-226. · Zbl 0675.05028 · doi:10.1016/S0167-5060(08)70310-8
[715] Wojciech Samotij: Stability results for discrete random structures, Random Structures & Algorithms 44 (2014), 269-289. · Zbl 1290.05131 · doi:10.1002/rsa.20477
[716] Tom Sanders: On a non-abelian Balog-Szemerédi-type lemma, J. Aust. Math. Soc. 89 (2010), 127-132. · Zbl 1223.11014 · doi:10.1017/S1446788710000236
[717] T. Sanders: On Roth’s theorem on progressions. Ann. of Math. (2) 174 (1) (2011), 619-636. · Zbl 1264.11004
[718] T. Sanders: Roth’s theorem: an application of approximate groups. Proceedings of the International Congress of Mathematicians-Seoul 2014. Vol. III, 401-423, Kyung Moon Sa, Seoul, (2014). · Zbl 1386.11025
[719] Alexander A. Sapozhenko: On the number of sum-free sets in Abelian groups, Vestnik Moskov. Univ. Ser. Mat. Mekh. 4 (2002) 14-18. · Zbl 1094.11502
[720] A. A. Sapozhenko: Asymptotics of the number of sum-free sets in abelian groups of even order, Rossiiskaya Akademiya Nauk. Dokladi Akademii Nauk 383 (2002), 454-457. · Zbl 1197.11131
[721] A.A. Sapozhenko: ‘Solution of the Cameron-Erdős problem for groups of prime order’, Zh. Vychisl. Mat. Mat. Fiz. 49 (2009) 1435-1441. · Zbl 1199.11060
[722] Gábor N. Sárközy: Cycles in bipartite graphs and an application in number theory. J. Graph Theory 19 (3) (1995), 323-331. · Zbl 0821.05034 · doi:10.1002/jgt.3190190305
[723] G.N. Sárközy: The regularity method, and the Blow-up method and their application, Thesis for Doctor of Sciences of Hungarian Acad Sci (with an Introduction in Hungarian).
[724] G.N. Sárközy: Improved monochromatic loose cycle partitions in hypergraphs. Discrete Math. 334 (2014), 52-62. · Zbl 1298.05239 · doi:10.1016/j.disc.2014.06.025
[725] G.N. Sárközy: A quantitative version of the Blow-up Lemma, arXiv:1405.7302, submitted for publication. (2014)
[726] G.N. Sárközy: Monochromatic cycle power partitions. Discrete Math. 340 (2) (2017) 72-80. · Zbl 1351.05088 · doi:10.1016/j.disc.2016.08.009
[727] G.N. Sárközy and Stanley M. Selkow: An extension of the Ruzsa-Szemerédi theorem, Combinatorica 25 (1) (2004) 77-84. · Zbl 1065.05068
[728] G.N. Sárközy and S.M Selkow: On a Turán-type hypergraph problem of Brown, Erdős and T. Sós. Discrete Math. 297 (1-3) (2005), 190-195. · Zbl 1079.05063
[729] G.N. Sárközy and S.M. Selkow: On an anti-Ramsey problem of Burr, Erdős, Graham, and T. Sós. J. Graph Theory 52 (2) (2006), 147-156. · Zbl 1096.05519 · doi:10.1002/jgt.20148
[730] Norbert Sauer and J. Spencer: Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25 (1978) 295-302. · Zbl 0417.05037
[731] David Saxton and A. Thomason: Hypergraph containers, Invent. Math. 201 (2015), 925-992. arXiv:1204.6595v2 · Zbl 1320.05085
[732] Mathias Schacht: Extremal results for random discrete structures, Ann. Math. 184 (2016) 333-365. arXiv:1603.00894. · Zbl 1351.05207
[733] Richard H. Schelp: Some Ramsey-Turán type problems and related questions, Discrete Math. 312 (2012) 2158-2161. · Zbl 1244.05149 · doi:10.1016/j.disc.2011.09.015
[734] Wolfgang M. Schmidt: On a Problem of Heilbronn, Journal of the London Mathematical Society (2) 4 (1972) 545-550. · Zbl 0233.52005
[735] Alex Scott: Szemerédi’s Regularity Lemma for matrices and sparse graphs, Combin. Probab. Comput. 20 (2011) 455-466. · Zbl 1231.05141 · doi:10.1017/S0963548310000490
[736] Paul Seymour: Problem section, Combinatorics: Proceedings of the British Combinatorial Conference 1973 (T. P.McDonough and V.C. Mavron eds.), Lecture Note Ser., No. 13 (1974), pp. 201-202. London Mathematical Society, Cambridge University Press, London.
[737] Asaf Shapira and R. Yuster: The effect of induced subgraphs on quasi-randomness. Random Structures and Algorithms 36 (1) (2010), 90-109. · Zbl 1209.05230
[738] James B. Shearer: A note on the independence number of triangle-free graphs. Discrete Math. 46 (1) (1983) 83-87. · Zbl 0516.05053 · doi:10.1016/0012-365X(83)90273-X
[739] J.B. Shearer: A note on the independence number of triangle-free graphs. II. J. Combin. Theory Ser. B 53 (2) (1991) 300-307. · Zbl 0753.05074 · doi:10.1016/0095-8956(91)90080-4
[740] J.B. Shearer: The independence number of dense graphs with large odd girth, Electron. J. Combin. 2 (1995), Note 2 (electronic). · Zbl 0811.05032
[741] J.B. Shearer: On the independence number of sparse graphs. Random Struct. Alg. 7 (1995) 269-271. · Zbl 0834.05030 · doi:10.1002/rsa.3240070305
[742] Ilja D. Shkredov: Szemerédi’s theorem and problems of arithmetic progressions. Uspekhi Mat. Nauk 61 (6) (2006) 6(372), 111-178; translation in Russian Math. Surveys 61 (6) (2006), 1101-1166 · Zbl 1178.11012
[743] Alexander F. Sidorenko: Extremal estimates of probability measures and their combinatorial nature. (Russian) Izv. Akad. Nauk SSSR Ser. Mat. 46 (3) (1982), 535-568, · Zbl 0513.60013
[744] A.F. Sidorenko: The maximal number of edges in a homogeneous hypergraph containing no prohibited subgraphs, Mathematical Notes 41 (1987), 247-259. Translated from Matematicheskie Zametki. · Zbl 0677.05064
[745] A.F. Sidorenko: An unimprovable inequality for the sum of two symmetrically distributed random vectors. (Russian) Teor. Veroyatnost. i Primenen. 35 (3) (1990), 595-599; translation in Theory Probab. Appl. 35 (3) (1990), 613-617 (1991) · Zbl 0735.60015
[746] A.F. Sidorenko: Inequalities for functional generated by bipartite graphs, Discrete Math. Appl. 3 (3) (1991) 50-65 (in Russian); English transl., Discrete Math. Appl. 2 (5) (1992) 489-504. · Zbl 0787.05052
[747] A.F. Sidorenko: A correlation inequality for bipartite graphs, Graphs Combin. 9 (1993) 201-204. · Zbl 0777.05096 · doi:10.1007/BF02988307
[748] A.F. Sidorenko: Boundedness of optimal matrices in extremal multigraph and digraph problems, Combinatorica 13 (1993), 109-120. · Zbl 0774.05051 · doi:10.1007/BF01202793
[749] A.F. Sidorenko: What we know and what we do not know about Turán numbers, Graphs and Combinatorics 11 (1995), 179-199. · Zbl 0839.05050 · doi:10.1007/BF01929486
[750] A.F. Sidorenko: An Erdős-Gallai-type theorem for keyrings, Graphs Comb. 34 (4) (2018) 633-638. arXiv:1705.10254. · Zbl 1395.05087
[751] M. Simonovits: A method for solving extremal problems in graph theory, Theory of Graphs, Proc. Colloq. Tihany, (1966), (Ed. P. Erdős and G. Katona) Acad. Press, N.Y., (1968) pp. 279-319. · Zbl 0164.24604
[752] M. Simonovits: On the structure of extremal graphs, PhD thesis (1969), (Actually, “Candidate”, in Hungarian).
[753] M. Simonovits: On colour-critical graphs. Studia Sci. Math. Hungar. 7 (1972), 67-81. · Zbl 0272.05108
[754] 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. · Zbl 0299.05124 · doi:10.1007/BFb0066189
[755] M. Simonovits: The extremal graph problem of the icosahedron. J. Combinatorial Theory Ser. B 17 (1974) 69-79. · Zbl 0279.05124 · doi:10.1016/0095-8956(74)90051-3
[756] M. Simonovits: Extremal graph problems with symmetrical extremal graphs, additional chromatic conditions, Discrete Mathematics 7 (1974), 349-376. · Zbl 0274.05113 · doi:10.1016/0012-365X(74)90044-2
[757] M. Simonovits: On Paul Turán’s influence on graph theory, J. Graph Theory 1 (2) (1977), 102-116. · Zbl 0383.05023 · doi:10.1002/jgt.3190010205
[758] M. Simonovits: Extremal graph theory, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory II., Academic Press, London, (1983), pp. 161-200. · Zbl 0531.05037
[759] M. Simonovits: Extremal graph problems and graph products, in Studies in Pure Mathematics, Birkhäuser, Basel, 1983, pp. 669-680. · Zbl 0525.05034
[760] M. Simonovits: Extremal graph problems, Degenerate extremal problems and Supersaturated graphs, Progress in Graph Theory (Acad. Press, ed. Bondy and Murty) (1984) 419-437. · Zbl 0556.05038
[761] M. Simonovits: Paul Erdős’ influence on extremal graph theory, The mathematics of Paul Erdős, II, 148-192, Algorithms Combin., 14 (1997), Springer, Berlin. (See also with the same title an updated version, in “The Mathematics of Paul Erdős” (eds Graham, Butler, Nešetřil, 2013) · Zbl 0863.05045
[762] M. Simonovits: How to solve a Turán type extremal graph problem? (linear decomposition), Contemporary trends in discrete mathematics (Stirin Castle, 1997), pp. 283-305, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 49 (1999), Amer. Math. Soc., Providence, RI. · Zbl 0929.05043
[763] M. Simonovits: Paul Erdős’ Influence on Extremal Graph Theory (Updated/Extended version of [760]), Springer, (2013) (eds Baker, Graham and Nešetřil). · Zbl 0863.05045
[764] M. Simonovits: Paul Turán’s influence in Combinatorics, in Turán Memorial: Number Theory, Analysis, and Combinatorics 309-392, De Gruyter, (2013). · Zbl 1301.05191
[765] M. Simonovits and V.T. Sós: Szemerédi’s partition and quasirandomness, Random Struct. Algorithms 2 (1991), 1-10. · Zbl 0766.05080 · doi:10.1002/rsa.3240020102
[766] M. Simonovits and V.T. Sós: Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Combinatorica 17 (1997), 577-596. · Zbl 0906.05066 · doi:10.1007/BF01195005
[767] M. Simonovits and V.T. Sós: Ramsey-Turán theory. Combinatorics, graph theory, algorithms and applications. Discrete Math. 229 (1-3) (2001) 293-340. · Zbl 0965.05072
[768] M. Simonovits and V.T. Sós: Hereditarily extended properties, quasi-random graphs and induced subgraphs, Combin. Probab. Comput. 12 (2003), 319-344. · Zbl 1043.05107 · doi:10.1017/S0963548303005613
[769] Jozef Skokan and Luboš Thoma: Bipartite subgraphs and quasi-randomness. Graphs Combin. 20 (2) (2004), 255-262. · Zbl 1054.05091 · doi:10.1007/s00373-004-0556-1
[770] József Solymosi: Regularity, uniformity, and quasirandomness. Proc. Natl. Acad. Sci. USA 102 (23) (2005), 8075-8076. · Zbl 1191.05057 · doi:10.1073/pnas.0503263102
[771] J. Solymosi: On the number of sums and products. Bulletin of the London Mathematical Society 37 (2005) 491-494. · Zbl 1092.11018 · doi:10.1112/S0024609305004261
[772] J. Solymosi: The \((7,4)\)-conjecture in finite groups. Combin. Probab. Comput. 24 (4) (2015) 680-686. · Zbl 1371.05302 · doi:10.1017/S0963548314000856
[773] Vera T. Sós: On extremal problems in graph theory, Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969) pp. 407-410 Gordon and Breach, New York (1970) · Zbl 0253.05145
[774] V.T. Sós: Remarks on the connection of graph theory, finite geometry and block designs; in: Teorie Combinatorie, Tomo II, Accad. Naz. Lincei, Rome, (1976), 223-233. · Zbl 0361.05022
[775] V.T. Sós: An additive problem in different structures, in: Proc. of the Second Int. Conf. in Graph Theory, Combinatorics, Algorithms, and Applications, San Fra. Univ., California, July 1989, SIAM, Philadelphia, (1991), pp. 486-510. · Zbl 0760.05088
[776] V.T. Sós: Turbulent years: Erdős in his correspondence with Turán from 1934 to 1940. Paul Erdős and his mathematics, I (Budapest, 1999), 85-146, Bolyai Soc. Math. Stud., 11 (2002), János Bolyai Math. Soc., Budapest. · Zbl 1076.01029
[777] Joel Spencer: Ramsey’s theorem – a new lower bound. J. Combinatorial Theory Ser. A 18 (1975), 108-115. · Zbl 0296.05003
[778] J. Spencer: “Ten Lectures on the Probabilistic Method,” SIAM, Philadelphia, (1987). · Zbl 0703.05046
[779] J. Spencer: Eighty years of Ramsey \(R(3,k)\)...and counting! Ramsey theory, 27-39, Progress in Math., 285 (2011) Birkhäuser/Springer, New York. · Zbl 1221.05245
[780] J. Spencer: Erdős magic. The mathematics of Paul Erdős. I, 43-46, Springer, New York, (2013).
[781] Ladislas Stacho: Locally pancyclic graphs, J. Combin. Theory Ser. B 76 (1999), 22-40. · Zbl 0929.05047 · doi:10.1006/jctb.1998.1885
[782] Angelika Steger: The determinism of randomness and its use in combinatorics. Proceedings of the International Congress of Mathematicians-Seoul 2014. Vol. IV, 475-488, Kyung Moon Sa, Seoul, (2014). · Zbl 1373.05180
[783] Michael Stiebitz: Subgraphs of colour-critical graphs. Combinatorica 7 (3) (1987) 303-312. · Zbl 0642.05020 · doi:10.1007/BF02579307
[784] M. Stiebitz, Zs. Tuza, and Margit Voigt: On list critical graphs. Discrete Math. 309 (15) (2009) 4931-4941. · Zbl 1229.05157
[785] Anne P. Street: Sum-free sets. In: Lecture Notes in Math. 292 (1972), 123-272. Springer. · Zbl 0259.20048
[786] Benny Sudakov: A few remarks on Ramsey-Turán-type problems, J. Combin. Theory Ser. B 88 (1) (2003) 99-106. · Zbl 1029.05104 · doi:10.1016/S0095-8956(02)00038-2
[787] B. Sudakov and V.H. Vu: Local resilience of graphs. Random Structures and Algorithms 33 (4) (2008), 409-433. · Zbl 1182.05114 · doi:10.1002/rsa.20235
[788] Balázs Szegedy: Gowers norms, regularization and limits of functions on abelian groups, preprint. arXiv:1010.6211. · Zbl 1395.05183
[789] E. Szemerédi: On sets of integers containing no four elements in arithmetic progression. Acta Math. Acad. Sci. Hungar. 20 (1969) 89-104. · Zbl 0175.04301 · doi:10.1007/BF01894569
[790] E. Szemerédi: On graphs containing no complete subgraph with 4 vertices (Hungarian), Mat. Lapok 23 (1972), 113-116. · Zbl 0277.05134
[791] E. Szemerédi: On sets of integers containing no \(k\) elements in arithmetic progression, Acta Arith. 27 (1975) 199-245, Collection of articles in memory of Jurii Vladimirovich Linnik. · Zbl 0303.10056
[792] E. Szemerédi: Regular partitions of graphs. In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS, pages 399-401. CNRS, Paris, 1978. · Zbl 0413.05055
[793] E. Szemerédi: Integer sets containing no arithmetic progressions, Acta Math. Hungar, 56 (1990), 155-158. · Zbl 0721.11007 · doi:10.1007/BF01903717
[794] E. Szemerédi: Is laziness paying off? (“Absorbing” method). Colloquium De Giorgi 2010-2012, 17-34, Colloquia, 4, Ed. Norm., Pisa, 2013.
[795] E. Szemerédi: Arithmetic progressions, different regularity lemmas and removal lemmas. Commun. Math. Stat. 3 (3) (2015), 315-328. · Zbl 1397.11019 · doi:10.1007/s40304-015-0062-1
[796] E. Szemerédi: Erdős’s unit distance problem. Open problems in mathematics, 459-477, Springer, [Cham], 2016. · Zbl 1354.52019
[797] E. Szemerédi and W.T. Trotter Jr.: Extremal problems in discrete geometry. Combinatorica 3 (3-4) (1983), 381-392. · Zbl 0541.05012 · doi:10.1007/BF02579194
[798] Terrence C. Tao: Szemerédi’s regularity lemma revisited. Contrib. Discrete Math. 1 (1) (2006), 8-28. · Zbl 1093.05030
[799] T.C. Tao: A variant of the hypergraph removal lemma, Journal of Combinatorial Theory, Ser. A 113 (2006), 1257-1280. · Zbl 1105.05052
[800] T.C. Tao: The Gaussian primes contain arbitrarily shaped constellations, J. Anal. Math. 99 (2006), 109-176. · Zbl 1160.11006 · doi:10.1007/BF02789444
[801] T.C. Tao and V.H. Vu: Additive Combinatorics, volume 105 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, 2006.
[802] T.C. Tao and V.H. Vu: Sum-free sets in groups: a survey. J. Comb. 8 (3) (2017) 541-552. · Zbl 1431.11026
[803] Andrew Thomason: Pseudorandom graphs, Random graphs ’85 (Poznań, 1985), North-Holland Math. Stud., 144 (1987) North-Holland, Amsterdam, 307-331. · Zbl 0632.05045
[804] A. Thomason: Random graphs, strongly regular graphs and Pseudorandom graphs, in: Surveys in combinatorics 1987 (New Cross, 1987), 173-195. · Zbl 0672.05068
[805] C. Thomassen: Long cycles in digraphs with constraints on the degrees, in: B. Bollobás (Ed.), Surveys in Combinatorics, in: London Math. Soc. Lecture Notes, vol. 38 (1979) pp. 211-228. Cambridge University Press. · Zbl 0407.05039
[806] Craig Timmons and Jacques Verstraëte: A counterexample to sparse removal. European J. Combin. 44 (2015), part A, 77-86. arXiv:1312.2994. · Zbl 1302.05089
[807] Bjarne Toft: Two theorems on critical \(4\)-chromatic graphs. Studia Sci. Math. Hungar. 7 (1972), 83-89. · Zbl 0259.05110
[808] Paul Turán: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48 (1941) 436-452. (For its English version see [810].) · Zbl 0026.26903
[809] P. Turán: On the theory of graphs, Colloq. Math. 3 (1954) 19-30. · Zbl 0055.17004 · doi:10.4064/cm-3-1-19-30
[810] P. Turán: Applications of graph theory to geometry and potential theory. Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969) pp. 423-434 Gordon and Breach, New York (1970) · Zbl 0272.05119
[811] P. Turán: Collected papers. Akadémiai Kiadó, Budapest, 1989. Vol. 1-3, (with comments of Simonovits on Turán’s papers in Combinatorics and by others on other topics).
[812] Michail Tyomkyn and Andrew J. Uzzell: Strong Turán stability. Electron. J. Combin. 22 (3) (2015), Paper 3.9, 24 pp. · Zbl 1327.05168
[813] Bartel L. van der Waerden: Beweis einer Baudetschen Vermutung, Nieuw Arch. Wisk. 15 (1927), 212-216. · JFM 53.0073.12
[814] Richard Wenger: Extremal graphs with no \(C^{4,}{\rm s}, C^{6,}{\rm s}\) or \(C^{10,}{\rm s}\) J. Combin. Theory Ser. B, 52 (1991), 113-116. · Zbl 0755.05060 · doi:10.1016/0095-8956(91)90097-4
[815] Richard M. Wilson: An existence theory for pairwise balanced designs. I. Composition theorems and morphisms. J. Combinatorial Theory Ser. A 13 (1972), 220-245. · Zbl 0263.05014
[816] R.M. Wilson: An existence theory for pairwise balanced designs. II. The structure of PBD-closed sets and the existence conjectures. J. Combinatorial Theory Ser. A 13 (1972), 246-273. · Zbl 0263.05015
[817] R.M. Wilson: An existence theory for pairwise balanced designs. III. Proof of the existence conjectures. J. Combinatorial Theory Ser. A 18 (1975) 71-79. · Zbl 0295.05002
[818] R.M. Wilson: Decompositions of complete graphs into subgraphs isomorphic to a given graph, in: Proceedings of the Fifth British Combinatorial Conference, Univ. Aberdeen, Aberdeen, 1975, Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man., 1976, pp. 647-659. · Zbl 0322.05116
[819] Hian Poh Yap: Maximal sum-free sets of group elements, Journal of the London Mathematical Society 44 (1969), 131-136. · Zbl 0165.34102
[820] H.P. Yap: Maximal sum-free sets in finite abelian groups. V., Bull. Austral. Math. Soc. 13 (3) (1975) 337-342. · Zbl 0319.20064
[821] Raphael Yuster: Tiling transitive tournaments and their blow-ups. Order 20 (2) (2003), 121-133. · Zbl 1041.05043 · doi:10.1023/B:ORDE.0000009250.31770.34
[822] R. Yuster: Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets, In Proceedings of the 12th International Workshop on Randomization and Computation (RANDOM), Springer Verlag, Boston, MA, 2008, pp. 596-601. · Zbl 1159.05320
[823] Yi Zhao: Bipartite graph tiling. SIAM J. Discrete Math. 23 (2) (2009), 888-900. · Zbl 1191.05075 · doi:10.1137/060665397
[824] Yi Zhao: Proof of the \((n/2-n/2-n/2)\) Conjecture for large n, Electron. J. Combin., 18 (2011), 27. 61 pp. · Zbl 1231.05142
[825] Yi Zhao: Recent advances on Dirac-type problems for hypergraphs, in: Recent Trends in Combinatorics, the IMA Volumes in Mathematics and its Applications, vol. 159, Springer, New York, 2016.
[826] Alexander A. Zykov: On some properties of linear complexes. Mat. Sb. 24 (66) (1949), 163-188. (in Russian); English translation in Amer. Math. Soc. Transl., 1952 (1952), 79.
[827] Paul Erdős’ homepage is: www.renyi.hu/ p_erdos
[828] Miklós Simonovits’ homepage is: www.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.