{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T10:32:01Z","timestamp":1773829921117,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:00:00Z","timestamp":1682985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00493-023-00034-7","type":"journal-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T15:03:33Z","timestamp":1683039813000},"page":"743-768","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Three Early Problems on Size Ramsey Numbers"],"prefix":"10.1007","volume":"43","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":[[2023,5,2]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1090\/S0894-0347-2014-00816-X","volume":"28","author":"J Balogh","year":"2015","unstructured":"Balogh, J., Morris, R., Samotij, W.: Independent sets in hypergraphs. J. Am. Math. Soc. 28, 669\u2013709 (2015)","journal-title":"J. Am. Math. Soc."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/jgt.3190070115","volume":"7","author":"J Beck","year":"1983","unstructured":"Beck, J.: On size Ramsey number of paths, trees, and circuits. I. J. Graph Theory 7, 115\u2013129 (1983)","journal-title":"J. Graph Theory"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Beck, J.: On size Ramsey number of paths, trees and circuits. II. In: Mathematics of Ramsey Theory, Algorithms Combin., vol. 5, pp. 34\u201345. Springer, Berlin (1990)","DOI":"10.1007\/978-3-642-72905-8_4"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1112\/jlms.12408","volume":"103","author":"S Berger","year":"2021","unstructured":"Berger, S., Kohayakawa, Y., Maesaka, G.S., Martins, T., Mendon\u00e7a, W., Mota, G.O., Parczyk, O.: The size-Ramsey number of powers of bounded degree trees. J. Lond. Math. Soc. 103, 1314\u20131332 (2021)","journal-title":"J. Lond. Math. Soc."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1002\/jgt.22432","volume":"91","author":"D Clemens","year":"2019","unstructured":"Clemens, D., Jenssen, M., Kohayakawa, Y., Morrison, N., Mota, G.O., Reding, D., Roberts, B.: The size-Ramsey number of powers of paths. J. Graph Theory 91, 290\u2013299 (2019)","journal-title":"J. Graph Theory"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1017\/S0963548320000322","volume":"30","author":"D Clemens","year":"2021","unstructured":"Clemens, D., Miralaei, M., Reding, D., Schacht, M., Taraz, A.: On the size-Ramsey number of grid graphs. Comb. Probab. Comput. 30, 670\u2013685 (2021)","journal-title":"Comb. Probab. Comput."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Conlon, D.: The Ramsey number of books, Adv. Comb., Paper No. 3, 12 pp. (2019)","DOI":"10.19086\/aic.10808"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Conlon, D., Fox, J., Sudakov, B.: Recent developments in graph Ramsey theory. In: Surveys in combinatorics 2015, London Math. Soc. Lecture Note Ser., vol. 424, pp. 49\u2013118. Cambridge Univ. Press, Cambridge (2015)","DOI":"10.1017\/CBO9781316106853.003"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00493-021-4409-9","volume":"42","author":"D Conlon","year":"2022","unstructured":"Conlon, D., Fox, J., Wigderson, Y.: Ramsey numbers of books and quasirandomness. Combinatorica 42, 309\u2013363 (2022)","journal-title":"Combinatorica"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Conlon, D., Fox, J., Wigderson, Y.: Off-diagonal book Ramsey numbers. Combin. Probab. Comput. 32, 516\u2013545 (2023)","DOI":"10.1017\/S0963548322000360"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.4007\/annals.2016.184.2.2","volume":"184","author":"D Conlon","year":"2016","unstructured":"Conlon, D., Gowers, W.T.: Combinatorial theorems in sparse random sets. Ann. Math. 184, 367\u2013454 (2016)","journal-title":"Ann. Math."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"2135","DOI":"10.1112\/blms.12682","volume":"54","author":"D Conlon","year":"2022","unstructured":"Conlon, D., Nenadov, R., Truji\u0107, M.: The size-Ramsey number of cubic graphs. Bull. Lond. Math. Soc. 54, 2135\u20132150 (2022)","journal-title":"Bull. Lond. Math. Soc."},{"key":"34_CR13","unstructured":"Conlon, D., Nenadov, R., Truji\u0107, M.: On the size-Ramsey number of grids, to appear in Combin. Probab. Comput. Preprint available at arXiv:2202.01654 [math.CO]"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Dragani\u0107, N., Krivelevich, M., Nenadov, R.: Rolling backwards can move you forward: on embedding problems in sparse expanders. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 123\u2013134. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2021)","DOI":"10.1137\/1.9781611976465.9"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/rsa.20995","volume":"59","author":"N Dragani\u0107","year":"2021","unstructured":"Dragani\u0107, N., Krivelevich, M., Nenadov, R.: The size-Ramsey number of short subdivisions. Random Struct. Algorithms 59, 68\u201378 (2021)","journal-title":"Random Struct. Algorithms"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02018930","volume":"9","author":"P Erd\u0151s","year":"1978","unstructured":"Erd\u0151s, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: The size Ramsey number. Period. Math. Hungar. 9, 145\u2013161 (1978)","journal-title":"Period. Math. Hungar."},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0012-365X(93)90521-T","volume":"113","author":"P Erd\u0151s","year":"1993","unstructured":"Erd\u0151s, P., Rousseau, C.C.: The size Ramsey number of a complete bipartite graph. Discrete Math. 113, 259\u2013262 (1993)","journal-title":"Discrete Math."},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02579202","volume":"7","author":"J Friedman","year":"1987","unstructured":"Friedman, J., Pippenger, N.: Expanding graphs contain all small trees. Combinatorica 7, 71\u201376 (1987)","journal-title":"Combinatorica"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.jctb.2020.06.004","volume":"145","author":"J Han","year":"2020","unstructured":"Han, J., Jenssen, M., Kohayakawa, Y., Mota, G.O., Roberts, B.: The multicolour size-Ramsey number of powers of paths. J. Comb. Theory Ser. B 145, 359\u2013375 (2020)","journal-title":"J. Comb. Theory Ser. B"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Han, J., Kohayakawa, Y., Letzter, S., Mota, G.O., Parczyk, O.: The size-Ramsey number of 3-uniform tight paths. Adv. Comb., Paper No. 5, 12pp. (2021)","DOI":"10.19086\/aic.24581"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S0963548300001619","volume":"4","author":"PE Haxell","year":"1995","unstructured":"Haxell, P.E., Kohayakawa, Y., \u0141uczak, T.: The induced size-Ramsey number of cycles. Comb. Probab. Comput. 4, 217\u2013239 (1995)","journal-title":"Comb. Probab. Comput."},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (2000)","DOI":"10.1002\/9781118032718"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/20M1335790","volume":"35","author":"N Kam\u010dev","year":"2021","unstructured":"Kam\u010dev, N., Liebenau, A., Wood, D.R., Yepremyan, L.: The size Ramsey number of graphs with bounded treewidth. SIAM J. Discret. Math. 35, 281\u2013293 (2021)","journal-title":"SIAM J. Discret. Math."},{"key":"34_CR24","doi-asserted-by":"publisher","first-page":"5041","DOI":"10.1016\/j.aim.2011.01.004","volume":"226","author":"Y Kohayakawa","year":"2011","unstructured":"Kohayakawa, Y., R\u00f6dl, V., Schacht, M., Szemer\u00e9di, E.: Sparse partition universal graphs for graphs of bounded degree. Adv. Math. 226, 5041\u20135065 (2011)","journal-title":"Adv. Math."},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"Krivelevich, M., Sudakov, B.: Pseudo-random graphs, in More sets, graphs and numbers. In: Bolyai Soc. Math. Stud., vol. 15, pp. 199\u2013262. Springer, Berlin (2006)","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"34_CR26","unstructured":"Letzter, S., Pokrovskiy, A., Yepremyan, L.: Size-Ramsey numbers of powers of hypergraph trees and long subdivisions. Preprint available at arXiv:2103.01942 [math.CO]"},{"key":"34_CR27","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"2007","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises, 2nd edn. AMS Chelsea Publishing, Providence (2007)","edition":"2"},{"key":"34_CR28","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S0895480101384086","volume":"16","author":"O Pikhurko","year":"2002","unstructured":"Pikhurko, O.: Asymptotic size Ramsey results for bipartite graphs. SIAM J. Discrete Math. 16, 99\u2013113 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR29","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s004930070024","volume":"20","author":"V R\u00f6dl","year":"2000","unstructured":"R\u00f6dl, V., Szemer\u00e9di, E.: On size Ramsey numbers of graphs with bounded degree. Combinatorica 20, 257\u2013262 (2000)","journal-title":"Combinatorica"},{"key":"34_CR30","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s00222-014-0562-8","volume":"201","author":"D Saxton","year":"2015","unstructured":"Saxton, D., Thomason, A.: Hypergraph containers. Invent. Math. 201, 925\u2013992 (2015)","journal-title":"Invent. Math."},{"key":"34_CR31","doi-asserted-by":"publisher","first-page":"333","DOI":"10.4007\/annals.2016.184.2.1","volume":"184","author":"M Schacht","year":"2016","unstructured":"Schacht, M.: Extremal results for random discrete structures. Ann. Math. 184, 333\u2013365 (2016)","journal-title":"Ann. Math."},{"key":"34_CR32","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/rsa.10088","volume":"23","author":"T Szab\u00f3","year":"2003","unstructured":"Szab\u00f3, T., Vu, V.H.: Tur\u00e1n\u2019s theorem in sparse random graphs. Random Struct. Algorithms 23, 225\u2013234 (2003)","journal-title":"Random Struct. Algorithms"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00034-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00034-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00034-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T16:06:16Z","timestamp":1692806776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00034-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,2]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["34"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00034-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,2]]},"assertion":[{"value":"28 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}