{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T17:57:34Z","timestamp":1777917454210,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,10,22]],"date-time":"2014-10-22T00:00:00Z","timestamp":1413936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00493-014-3025-3","type":"journal-article","created":{"date-parts":[[2014,10,22]],"date-time":"2014-10-22T09:09:10Z","timestamp":1413968950000},"page":"435-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The critical window for the classical Ramsey-Tur\u00e1n problem"],"prefix":"10.1007","volume":"35","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Po-Shen","family":"Loh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,22]]},"reference":[{"key":"3025_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The probabilistic method","author":"N. Alon","year":"2008","unstructured":"N. Alon and J. Spencer: The probabilistic method, 3rd ed., John Wiley & Sons Inc., Hoboken, NJ (2008).","edition":"3rd ed."},{"key":"3025_CR2","first-page":"1","volume":"31","author":"K. Ball","year":"1997","unstructured":"K. Ball: An elementary introduction to modern convex geometry, in: Flavors of geometry, Math. Sci. Res. Inst. Publ. 31, Cambridge Univ. Press, Cambridge, 1997, 1\u201358.","journal-title":"Flavors of geometry, Math. Sci. Res. Inst. Publ."},{"key":"3025_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s11856-012-0076-2","volume":"194","author":"J. Balogh","year":"2013","unstructured":"J. Balogh and J. Lenz: On the Ramsey-Tur\u00e1n numbers of graphs and hypergraphs, Israel J. Math. 194 (2013), 45\u201368.","journal-title":"Israel J. Math."},{"key":"3025_CR4","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1112\/blms\/bds053","volume":"44","author":"J. Balogh","year":"2012","unstructured":"J. Balogh and J. Lenz: Some exact Ramsey-Tur\u00e1n numbers, Bull. Lond. Math. Soc. 44 (2012), 1251\u20131258.","journal-title":"Bull. Lond. Math. Soc."},{"key":"3025_CR5","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0095-8956(76)90057-5","volume":"21","author":"B. Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s and P. Erd\u0151s: On a Ramsey-Tur\u00e1n type problem, J. Combin. Theory Ser. B. 21 (1976), 166\u2013168.","journal-title":"J. Combin. Theory Ser. B."},{"key":"3025_CR6","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1016\/j.aim.2008.07.008","volume":"219","author":"C. Borgs","year":"2008","unstructured":"C. Borgs, J. T. Chayes, L. Lov\u00e1sz, V. T. S\u00f3s and K. Vesztergombi: Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing, Adv. Math. 219 (2008), 1801\u20131851.","journal-title":"Adv. Math."},{"key":"3025_CR7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1002\/rsa.20376","volume":"39","author":"P. Ch\u00e2u","year":"2011","unstructured":"P. Ch\u00e2u, L. DeBiasio and H. A. Kierstead: P\u00f3sa\u2019s conjecture for graphs of order at least 2 \u00d7 108, Random Structures Algorithms 39 (2011), 507\u2013525.","journal-title":"Random Structures Algorithms"},{"key":"3025_CR8","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1017\/S0963548309990174","volume":"18","author":"D. Conlon","year":"2009","unstructured":"D. Conlon: Hypergraph packing and sparse bipartite Ramsey numbers, Combin. Probab. Comput., 18 (2009), 913\u2013923.","journal-title":"Combin. Probab. Comput."},{"key":"3025_CR9","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1007\/s00039-012-0171-x","volume":"22","author":"D. Conlon","year":"2012","unstructured":"D. Conlon and J. Fox: Bounds for graph regularity and removal lemmas, Geom. Funct. Anal. 22 (2012), 1191\u20131256.","journal-title":"Geom. Funct. Anal."},{"key":"3025_CR10","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00493-012-2710-3","volume":"32","author":"D. Conlon","year":"2012","unstructured":"D. Conlon, J. Fox and B. Sudakov: On two problems in graph Ramsey theory, Combinatorica 32 (2012), 513\u2013535.","journal-title":"Combinatorica"},{"key":"3025_CR11","first-page":"117","volume-title":"Theory of Graphs","author":"P. Erd\u0151s","year":"1967","unstructured":"P. Erd\u0151s: Some recent results on extremal problems in graph theory. Results, in: Theory of Graphs (Internat. Sympos., Rome, 1966), Gordon and Breach, New York, 1967, 117\u2013123."},{"key":"3025_CR12","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1017\/CBO9780511983917.039","volume-title":"A tribute to Paul Erd\u0151s","author":"P. Erd\u0151s","year":"1990","unstructured":"P. Erd\u0151s: Some of my favourite unsolved problems, in: A tribute to Paul Erd\u0151s, Cambridge University Press, 1990, 467\u2013478."},{"key":"3025_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02579342","volume":"3","author":"P. Erd\u0151s","year":"1983","unstructured":"P. Erd\u0151s, A. Hajnal, V. T. S\u00f3s and E. Szemer\u00e9di: More results on Ramsey-Tur\u00e1n type problem, Combinatorica 3 (1983), 69\u201382.","journal-title":"Combinatorica"},{"key":"3025_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01202788","volume":"13","author":"P. Erd\u0151s","year":"1993","unstructured":"P. Erd\u0151s, A. Hajnal, M. Simonovits, V. T. S\u00f3s and E. Szemer\u00e9di: Tur\u00e1n-Ramsey theorems and simple asymptotically extremal structures, Combinatorica 13 (1993), 31\u201356.","journal-title":"Combinatorica"},{"key":"3025_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1017\/CBO9780511662034.025","volume-title":"Combinatorics, geometry and probability","author":"P. Erd\u0151s","year":"1997","unstructured":"P. Erd\u0151s, A. Hajnal, M. Simonovits, V. T. S\u00f3s and E. Szemer\u00e9di: Tur\u00e1n- Ramsey theorems and K p-independence number, in: Combinatorics, geometry and probability (Cambridge, 1993), Cambridge Univ. Press, Cambridge, 1997, 253\u2013281."},{"key":"3025_CR16","first-page":"395","volume-title":"Combinatorial theory and its applications, II","author":"P. Erd\u0151s","year":"1970","unstructured":"P. Erd\u0151s and V. T. S\u00f3s: Some remarks on Ramsey\u2019s and Tur\u00e1n\u2019s theorem, in: Combinatorial theory and its applications, II (Proc. Colloq., Balatonf\u00fcred, 1969), North-Holland, Amsterdam, 1970, 395\u2013404."},{"key":"3025_CR17","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1002\/rsa.10036","volume":"20","author":"U. Feige","year":"2002","unstructured":"U. Feige and G. Schechtman: On the optimality of the random hyperplane rounding technique for MAX CUT, Random Structures Algorithms 20 (2002), 403\u2013440.","journal-title":"Random Structures Algorithms"},{"key":"3025_CR18","doi-asserted-by":"crossref","first-page":"561","DOI":"10.4007\/annals.2011.174.1.17","volume":"174","author":"J. Fox","year":"2011","unstructured":"J. Fox: A new proof of the graph removal lemma, Ann. of Math. 174 (2011), 561\u2013579.","journal-title":"Ann. of Math."},{"key":"3025_CR19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00493-009-2475-5","volume":"29","author":"J. Fox","year":"2009","unstructured":"J. Fox and B. Sudakov: Density theorems for bipartite graphs and related Ramseytype results, Combinatorica 29 (2009), 153\u2013196.","journal-title":"Combinatorica"},{"key":"3025_CR20","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/rsa.20344","volume":"38","author":"J. Fox","year":"2011","unstructured":"J. Fox and B. Sudakov: Dependent random choice, Random Structures Algorithms 38 (2011), 68\u201399.","journal-title":"Random Structures Algorithms"},{"key":"3025_CR21","first-page":"12","volume-title":"Proceedings of the 37th IEEE FOCS","author":"A. Frieze","year":"1996","unstructured":"A. Frieze and R. Kannan: The regularity lemma and approximation schemes for dense problems, Proceedings of the 37th IEEE FOCS (1996), 12\u201320."},{"key":"3025_CR22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A. Frieze","year":"1999","unstructured":"A. Frieze and R. Kannan: Quick approximation to matrices and applications, Combinatorica 19 (1999), 175\u2013220.","journal-title":"Combinatorica"},{"key":"3025_CR23","doi-asserted-by":"crossref","first-page":"778","DOI":"10.2307\/2310464","volume":"66","author":"A. W. Goodman","year":"1959","unstructured":"A. W. Goodman: On sets of acquaintances and strangers at any party, American Mathematical Monthly 66 (1959), 778\u2013783.","journal-title":"American Mathematical Monthly"},{"key":"3025_CR24","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/PL00001621","volume":"7","author":"W. T. Gowers","year":"1997","unstructured":"W. T. Gowers: Lower bounds of tower type for Szemer\u00e9di\u2019s uniformity lemma, Geom. Funct. Anal. 7 (1997), 322\u2013337.","journal-title":"Geom. Funct. Anal."},{"key":"3025_CR25","first-page":"79","volume-title":"Geom. Funct. Anal.","author":"W. T. Gowers","year":"2000","unstructured":"W. T. Gowers: Rough structure and classification, GAFA 2000 (Tel Aviv, 1999), Geom. Funct. Anal. 2000, Special Volume, Part I, 79\u2013117."},{"key":"3025_CR26","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s00039-001-0332-9","volume":"11","author":"W. T. Gowers","year":"2001","unstructured":"W. T. Gowers: A new proof of Szemer\u00e9di\u2019s theorem, Geom. Funct. Anal. 11 (2001), 465\u2013588.","journal-title":"Geom. Funct. Anal."},{"key":"3025_CR27","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1002\/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C","volume":"35","author":"R. L. Graham","year":"2000","unstructured":"R. L. Graham, V. R\u00f6dl and A. Ruci\u0144ski: On graphs with linear Ramsey numbers, J. Graph Theory 35 (2000), 176\u2013192.","journal-title":"J. Graph Theory"},{"key":"3025_CR28","first-page":"295","volume-title":"Combinatorics, Paul Erd\u0151s is eighty, Vol. 2","author":"J. Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s and M. Simonovits: Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory, in: Combinatorics, Paul Erd\u0151s is eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud. 2, J\u00e1nos Bolyai Math. Soc., Budapest, 1996, 295\u2013352."},{"key":"3025_CR29","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-45878-6_3","volume-title":"Theoretical aspects of computer science","author":"J. Koml\u00f3s","year":"2002","unstructured":"J. Koml\u00f3s, A. Shokoufandeh, M. Simonovits and E. Szemer\u00e9di: 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\u2013112."},{"key":"3025_CR30","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.disc.2009.05.020","volume":"310","author":"I. Levitt","year":"2010","unstructured":"I. Levitt, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: How to avoid using the regularity lemma: P\u00f3sa\u2019s conjecture revisited, Discrete Math. 310 (2010), 630\u2013641.","journal-title":"Discrete Math."},{"key":"3025_CR31","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-642-13580-4_11","volume-title":"Fete of Combinatorics and Computer Science","author":"V. R\u00f6dl","year":"2010","unstructured":"V. R\u00f6dl and M. Schacht: Regularity lemmas for graphs, in: Fete of Combinatorics and Computer Science, Bolyai Soc. Math. Stud. 20, 2010, 287\u2013325."},{"key":"3025_CR32","first-page":"939","volume-title":"Combinatorics","author":"I. Z. Ruzsa","year":"1976","unstructured":"I. Z. Ruzsa and E. Szemer\u00e9di: Triple systems with no six points carrying three triangles, in: Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai 18, Volume II, 939\u2013945."},{"key":"3025_CR33","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/mana.19480010202","volume":"1","author":"E. Schmidt","year":"1948","unstructured":"E. Schmidt: Die Brunn-Minkowski Ungleichung und ihr Spiegelbild sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und nichteuklidischen Geometrie I, Math Nachrichten 1 (1948), 81\u2013157.","journal-title":"Math Nachrichten"},{"key":"3025_CR34","doi-asserted-by":"crossref","unstructured":"J. B. Shearer: The independence number of dense graphs with large odd girth, Electron. J. Combin. 2 (1995), Note 2 (electronic).","DOI":"10.37236\/1221"},{"key":"3025_CR35","first-page":"279","volume-title":"Theory of Graphs","author":"M. Simonovits","year":"1968","unstructured":"M. Simonovits: A method for solving extremal problems in graph theory, stability problems, in: Theory of Graphs (Proc. Colloq., Tihany, 1966), Academic Press, New York, 1968, 279\u2013319."},{"key":"3025_CR36","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0012-365X(00)00214-4","volume":"229","author":"M. Simonovits","year":"2001","unstructured":"M. Simonovits and V. T. S\u00f3s: Ramsey-Tur\u00e1n theory, Discrete Math. 229 (2001), 293\u2013340.","journal-title":"Discrete Math."},{"key":"3025_CR37","first-page":"407","volume-title":"Proceedings of the Calgary International Conference on Combinatorial Structures and their Application","author":"V. T. S\u00f3s","year":"1969","unstructured":"V. T. S\u00f3s: On extremal problems in graph theory, in: Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, 1969, 407\u2013410."},{"key":"3025_CR38","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0095-8956(02)00038-2","volume":"88","author":"B. Sudakov","year":"2003","unstructured":"B. Sudakov: A few remarks on Ramsey-Tur\u00e1n-type problems, J. Combin. Theory Ser. B 88 (2003), 99\u2013106.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3025_CR39","first-page":"113","volume":"23","author":"E. Szemer\u00e9di","year":"1972","unstructured":"E. Szemer\u00e9di: On graphs containing no complete subgraph with 4 vertices (Hungarian), Mat. Lapok 23 (1972), 113\u2013116.","journal-title":"Mat. Lapok"},{"key":"3025_CR40","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E. Szemer\u00e9di","year":"1975","unstructured":"E. Szemer\u00e9di: On sets of integers containing no \u03ba elements in arithmetic progression, Acta Arith. 27 (1975), 199\u2013245.","journal-title":"Acta Arith."},{"key":"3025_CR41","first-page":"399","volume-title":"Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes","author":"E. Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, in: Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), Colloq. Internat. CNRS 260, CNRS, Paris, 1978, 399\u2013401."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3025-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3025-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3025-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T01:48:41Z","timestamp":1598406521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3025-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,22]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["3025"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3025-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,22]]}}}