{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T18:09:39Z","timestamp":1775671779486,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T00:00:00Z","timestamp":1646870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T00:00:00Z","timestamp":1646870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00493-021-4409-9","type":"journal-article","created":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T02:02:29Z","timestamp":1646964149000},"page":"309-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Ramsey Numbers of Books and Quasirandomness"],"prefix":"10.1007","volume":"42","author":[{"given":"David","family":"Conlon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Wigderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,10]]},"reference":[{"key":"4409_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F R K Chung","year":"1989","unstructured":"F. R. K. Chung, R. L. Graham and R. M. Wilson: Quasi-random graphs, Combinatorica 9 (1989), 345\u2013362.","journal-title":"Combinatorica"},{"key":"4409_CR2","doi-asserted-by":"publisher","first-page":"941","DOI":"10.4007\/annals.2009.170.941","volume":"170","author":"D Conlon","year":"2009","unstructured":"D. Conlon: A new upper bound for diagonal Ramsey numbers, Ann. of Math. 170 (2009), 941\u2013960.","journal-title":"Ann. of Math."},{"key":"4409_CR3","doi-asserted-by":"crossref","unstructured":"D. Conlon: The Ramsey number of books, Adv. Combin., Paper No. 3, 2019.","DOI":"10.19086\/aic.10808"},{"key":"4409_CR4","doi-asserted-by":"publisher","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":"4409_CR5","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0097539793247634","volume":"24","author":"R A Duke","year":"1995","unstructured":"R. A. Duke, H. Lefmann and V. R\u00f6dl: A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J. Comput. 24 (1995), 598\u2013620.","journal-title":"SIAM J. Comput."},{"key":"4409_CR6","first-page":"459","volume":"7","author":"P Erd\u0151s","year":"1962","unstructured":"P. Erd\u0151s: On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 7 (1962), 459\u2013464.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"4409_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02018930","volume":"9","author":"P Erd\u0151s","year":"1978","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau and R. H. Schelp: The size Ramsey number, Period. Math. Hungar. 9 (1978), 145\u2013161.","journal-title":"Period. Math. Hungar."},{"key":"4409_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02018669","volume":"2","author":"P Erd\u0151s","year":"1972","unstructured":"P. Erd\u0151s and A. Szemer\u00e9di: On a Ramsey type theorem, Period. Math. Hungar. 2 (1972), 295\u2013299.","journal-title":"Period. Math. Hungar."},{"key":"4409_CR9","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1016\/j.aim.2008.07.009","volume":"219","author":"J Fox","year":"2008","unstructured":"J. Fox and B. Sudakov: Induced Ramsey-type theorems, Adv. Math. 219 (2008), 1771\u20131800.","journal-title":"Adv. Math."},{"key":"4409_CR10","first-page":"12","volume-title":"37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996)","author":"A Frieze","year":"1996","unstructured":"A. Frieze and R. Kannan: The regularity lemma and approximation schemes for dense problems, in: 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), 12\u201320, IEEE Comput. Soc. Press, Los Alamitos, CA, 1996."},{"key":"4409_CR11","doi-asserted-by":"publisher","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":"4409_CR12","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1080\/00029890.1959.11989408","volume":"66","author":"A W Goodman","year":"1959","unstructured":"A. W. Goodman: On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959), 778\u2013783.","journal-title":"Amer. Math. Monthly"},{"key":"4409_CR13","doi-asserted-by":"publisher","first-page":"3835","DOI":"10.1090\/proc\/15060","volume":"148","author":"M Jenssen","year":"2020","unstructured":"M. Jenssen, P. Keevash, E. Long and L. Yepremyan: Distinct degrees in induced subgraphs, Proc. Amer. Math. Soc. 148 (2020), 3835\u20133846.","journal-title":"Proc. Amer. Math. Soc."},{"key":"4409_CR14","first-page":"84","volume-title":"Theoretical aspects of computer science (Tehran, 2000), volume 2292 of Lecture Notes in Comput. Sci.","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), volume 2292 of Lecture Notes in Comput. Sci., 84\u2013112, Springer, Berlin, 2002."},{"key":"4409_CR15","doi-asserted-by":"publisher","first-page":"5571","DOI":"10.1090\/tran\/7729","volume":"372","author":"M Kwan","year":"2019","unstructured":"M. Kwan and B. Sudakov: Proof of a conjecture on induced subgraphs of Ramsey graphs, Trans. Amer. Math. Soc. 372 (2019), 5571\u20135594.","journal-title":"Trans. Amer. Math. Soc."},{"key":"4409_CR16","volume-title":"Large networks and graph limits, volume 60 of American Mathematical Society Colloquium Publications","author":"L Lov\u00e1sz","year":"2012","unstructured":"L. Lov\u00e1sz: Large networks and graph limits, volume 60 of American Mathematical Society Colloquium Publications, American Mathematical Society, Providence, RI, 2012."},{"key":"4409_CR17","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1017\/S0963548305006929","volume":"14","author":"V Nikiforov","year":"2005","unstructured":"V. Nikiforov, C. C. Rousseau and R. H. Schelp: Book Ramsey numbers and quasi-randomness, Combin. Probab. Comput. 14 (2005), 851\u2013860.","journal-title":"Combin. Probab. Comput."},{"key":"4409_CR18","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1006\/jcta.1999.2972","volume":"88","author":"H J Pr\u00f6mel","year":"1999","unstructured":"H. J. Pr\u00f6mel and V. R\u00f6dl: Non-Ramsey graphs are c log n-universal, J. Combin. Theory Ser. A 88 (1999), 379\u2013384.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4409_CR19","first-page":"264","volume":"30","author":"F P Ramsey","year":"1929","unstructured":"F. P. Ramsey: On a problem of formal logic, Proc. London Math. Soc. (2) 30 (1929), 264\u2013286.","journal-title":"Proc. London Math. Soc. (2)"},{"key":"4409_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/jgt.3190020110","volume":"2","author":"C C Rousseau","year":"1978","unstructured":"C. C. Rousseau and J. Sheehan: On Ramsey numbers for books, J. Graph Theory 2 (1978), 77\u201387.","journal-title":"J. Graph Theory"},{"key":"4409_CR21","unstructured":"V. T. S\u00f3s: Induced subgraphs and Ramsey colorings, Presented at the 16th International Conference on Random Structures and Algorithms, 2013."},{"key":"4409_CR22","series-title":"MAA Problem Books Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511817106","volume-title":"The Cauchy-Schwarz master class: An introduction to the art of mathematical inequalities","author":"J M Steele","year":"2004","unstructured":"J. M. Steele: The Cauchy-Schwarz master class: An introduction to the art of mathematical inequalities, MAA Problem Books Series, Mathematical Association of America, Washington, DC, Cambridge University Press, Cambridge, 2004."},{"key":"4409_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0195-6698(82)80038-3","volume":"3","author":"A Thomason","year":"1982","unstructured":"A. Thomason: On finite Ramsey numbers, European J. Combin. 3 (1982), 263\u2013273.","journal-title":"European J. Combin."},{"key":"4409_CR24","first-page":"307","volume-title":"Random graphs\u2019 85 (Pozna\u0144, 1985), volume 144 of North-Holland Math. Stud.","author":"A Thomason","year":"1987","unstructured":"A. Thomason: Pseudorandom graphs, in: Random graphs\u2019 85 (Pozna\u0144, 1985), volume 144 of North-Holland Math. Stud., 307\u2013331, North-Holland, Amsterdam, 1987."},{"key":"4409_CR25","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1112\/jlms\/s2-39.2.246","volume":"39","author":"A Thomason","year":"1989","unstructured":"A. Thomason: A disproof of a conjecture of Erd\u0151s in Ramsey theory, J. London Math. Soc. 39 (1989), 246\u2013255.","journal-title":"J. London Math. Soc."},{"key":"4409_CR26","unstructured":"Y. Zhao: Lecture notes on graph theory and additive combinatorics, http:\/\/yufeizhao.com\/gtac\/gtac.pdf, 2019."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4409-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4409-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4409-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T14:26:51Z","timestamp":1664980011000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4409-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,10]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["4409"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4409-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,10]]},"assertion":[{"value":"4 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}