{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:47:06Z","timestamp":1767008826963},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","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":[[2020,2]]},"DOI":"10.1007\/s00493-019-3921-7","type":"journal-article","created":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T03:05:36Z","timestamp":1580785536000},"page":"63-103","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Packing Nearly Optimal Ramsey R(3,t) Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"He","family":"Guo","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Warnke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,4]]},"reference":[{"key":"3921_CR1","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","volume":"29","author":"M Ajtai","year":"1980","unstructured":"M. Ajtai, J. Koml\u00f3s and E. Szemer\u00e9di: A note on Ramsey numbers, J. Combin. Theory Ser. A29 (1980), 354\u2013360.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3921_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0195-6698(81)80014-5","volume":"2","author":"M Ajtai","year":"1981","unstructured":"M. Ajtai, J. Koml\u00f3s and E. Szemer\u00e9di: A dense infinite Sidon sequence, European J. Combin.2 (1981), 1\u201311.","journal-title":"European J. Combin."},{"key":"3921_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02773639","volume":"100","author":"N Alon","year":"1997","unstructured":"N. Alon, J. H. Kim and J. Spencer: Nearly perfect matchings in regular simple hypergraphs, Israel J. Math.100 (1997), 171\u2013187.","journal-title":"Israel J. Math."},{"key":"3921_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/jgt.3190070115","volume":"7","author":"J Beck","year":"1983","unstructured":"J. Beck: On size Ramsey number of paths, trees, and circuits. I, J. Graph Theory7 (1983), 115\u2013129.","journal-title":"J. Graph Theory"},{"key":"3921_CR5","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.aim.2009.02.018","volume":"221","author":"T Bohman","year":"2009","unstructured":"T. Bohman: The triangle-free process, Adv. Math.221 (2009), 1653\u20131677.","journal-title":"Adv. Math."},{"key":"3921_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00222-010-0247-x","volume":"181","author":"T Bohman","year":"2010","unstructured":"T. Bohman and P. Keevash: The early evolution of the H-free process, Invent. Math.181 (2010), 291\u2013336.","journal-title":"Invent. Math."},{"key":"3921_CR7","doi-asserted-by":"crossref","unstructured":"T. Bohman and P. Keevash: Dynamic concentration of the triangle-free process, Preprint (2013). arXiv:1302.5963.","DOI":"10.1007\/978-88-7642-475-5_78"},{"key":"3921_CR8","first-page":"167","volume":"1","author":"S A Burr","year":"1976","unstructured":"S. A. Burr, P. Erd\u0151s and L. Lov\u00e1sz: On graphs of Ramsey type, Ars Combinatoria1 (1976), 167\u2013190.","journal-title":"Ars Combinatoria"},{"key":"3921_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/CBO9781316106853.003","volume-title":"Surveys in Combinatorics 2015","author":"D Conlon","year":"2015","unstructured":"D. Conlon, J. Fox and B. Sudakov: Recent developments in graph Ramsey theory, in: Surveys in Combinatorics 2015, 49\u2013118. Cambridge Univ. Press, Cambridge (2015)."},{"key":"3921_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P Erd\u0151s","year":"1947","unstructured":"P. Erd\u0151s: Some remarks on the theory of graphs, Bull. Amer. Math. Soc.53 (1947), 292\u2013294.","journal-title":"Bull. Amer. Math. Soc."},{"key":"3921_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.4153\/CJM-1961-029-9","volume":"13","author":"P Erd\u0151s","year":"1961","unstructured":"P. Erd\u0151s: Graph theory and probability. II, Canad. J. Math.13 (1961), 346\u2013352.","journal-title":"Canad. J. Math."},{"key":"3921_CR12","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":"3921_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/rsa.3240060217","volume":"6","author":"P Erd\u0151s","year":"1995","unstructured":"P. Erd\u0151s, S. Suen and P. Winkler: On the size of a random maximal graph, Rand. Struct. & Algor.6 (1995), 309\u2013318.","journal-title":"Rand. Struct. & Algor."},{"key":"3921_CR14","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Compositio Math.2 (1935), 463\u2013470.","journal-title":"Compositio Math."},{"key":"3921_CR15","unstructured":"G. Fiz Pontiveros, S. Griffiths and R. Morris: The triangle-free process and R(3, k), Memoirs of the Am. Math. Soc., to appear."},{"key":"3921_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jctb.2016.03.006","volume":"120","author":"J Fox","year":"2016","unstructured":"J. Fox, A. Grinshpun, A. Liebenau, Y. Person and T. Szab\u00f3: On the minimum degree of minimal Ramsey graphs for multiple colours, J. Combin. Theory Ser. B120 (2016), 64\u201382.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3921_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/jgt.20199","volume":"54","author":"J Fox","year":"2007","unstructured":"J. Fox and K. Lin: The minimum degree of Ramsey-minimal graphs, J. Graph Theory54 (2007), 167\u2013177.","journal-title":"J. Graph Theory"},{"key":"3921_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1017\/S0305004100034241","volume":"56","author":"T E Harris","year":"1960","unstructured":"T. E. Harris: A lower bound for the critical probability in a certain percolation process, Proc. Cambridge Philos. Soc.56 (1960), 13\u201320.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"3921_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcta.1996.0001","volume":"73","author":"J Kahn","year":"1996","unstructured":"J. Kahn: Asymptotically good list-colorings, J. Combin. Theory Ser. A73 (1996), 1\u201359.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3921_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"J H Kim","year":"1995","unstructured":"J. H. Kim: The Ramsey number R(3, t) has order of magnitude t2\/logt, Rand. Struct. & Algor.7 (1995), 173\u2013207.","journal-title":"Rand. Struct. & Algor."},{"key":"3921_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/rsa.3240070204","volume":"7","author":"M Krivelevich","year":"1995","unstructured":"M. Krivelevich: Bounding Ramsey numbers through large deviation inequalities, Rand. Struct. & Algor.7 (1995), 145\u2013155.","journal-title":"Rand. Struct. & Algor."},{"key":"3921_CR22","unstructured":"A. Liebenau: Orientation Games and Minimal Ramsey Graphs, PhD thesis, FU Berlin (2013)."},{"key":"3921_CR23","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1017\/CBO9781107359949.008","volume-title":"Surveys in Combinatorics 1989","author":"C McDiarmid","year":"1989","unstructured":"C. McDiarmid: On the method of bounded differences, in: Surveys in Combinatorics 1989, 148\u2013188. Cambridge Univ. Press, Cambridge (1989)."},{"key":"3921_CR24","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic methods for algorithmic discrete mathematics","author":"C McDiarmid","year":"1998","unstructured":"C. McDiarmid: Concentration, in: Probabilistic methods for algorithmic discrete mathematics, 195\u2013248. Springer, Berlin (1998)."},{"key":"3921_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T","volume":"18","author":"D Osthus","year":"2001","unstructured":"D. Osthus and A. Taraz: Random maximal H-free graphs, Rand. Struct. & Algor.18 (2001), 61\u201382.","journal-title":"Rand. Struct. & Algor."},{"key":"3921_CR26","unstructured":"Y. Person: Personal communication (RSA 2013 conference in Pozna\u0144), 2013."},{"key":"3921_CR27","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/rsa.20517","volume":"45","author":"M Picollelli","year":"2014","unstructured":"M. Picollelli: The diamond-free process, Rand. Struct. & Algor.45 (2014), 513\u2013551.","journal-title":"Rand. Struct. & Algor."},{"key":"3921_CR28","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F P Ramsey","year":"1930","unstructured":"F. P. Ramsey: On a Problem of Formal Logic, Proc. Lond. Math. Soc.30 (1930), 264\u2013286.","journal-title":"Proc. Lond. Math. Soc."},{"key":"3921_CR29","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/050647116","volume":"22","author":"V R\u00f6dl","year":"2008","unstructured":"V. R\u00f6dl and M. Siggers: On Ramsey minimal graphs, SIAM J. Discrete Math.22 (2008), 467\u2013488.","journal-title":"SIAM J. Discrete Math."},{"key":"3921_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s004930070024","volume":"20","author":"V R\u00f6dl","year":"2000","unstructured":"V. R\u00f6dl and E. Szemer\u00e9di: On size Ramsey numbers of graphs with bounded degree, Combinatorica20 (2000), 257\u2013262.","journal-title":"Combinatorica"},{"key":"3921_CR31","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(77)90044-9","volume":"20","author":"J Spencer","year":"1977","unstructured":"J. Spencer: Asymptotic lower bounds for Ramsey functions, Discrete Math.20 (1977), 69\u201376.","journal-title":"Discrete Math."},{"key":"3921_CR32","unstructured":"J. Spencer: Maximal triangle-free graphs and Ramsey R(3, t), Unpublished manuscript (1995). http:\/\/cs.nyu.edu\/spencer\/papers\/ramsey3k.pdf."},{"key":"3921_CR33","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1002\/jgt.20445","volume":"64","author":"T Szab\u00f3","year":"2010","unstructured":"T. Szab\u00f3, P. Zumstein and S. Z\u00fcrcher: On the minimum degree of minimal Ramsey graphs, J. Graph Theory64 (2010), 150\u2013164.","journal-title":"J. Graph Theory"},{"key":"3921_CR34","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/rsa.20444","volume":"44","author":"L Warnke","year":"2014","unstructured":"L. Warnke: When does the K4-free process stop? Rand. Struct. & Algor.44 (2014), 355\u2013397.","journal-title":"Rand. Struct. & Algor."},{"key":"3921_CR35","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1002\/rsa.20468","volume":"44","author":"L Warnke","year":"2014","unstructured":"L. Warnke: The C\u2113-free process, Rand. Struct. & Algor.44 (2014), 490\u2013526.","journal-title":"Rand. Struct. & Algor."},{"key":"3921_CR36","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S0963548315000103","volume":"25","author":"L Warnke","year":"2016","unstructured":"L. Warnke: On the method of typical bounded differences, Combin. Probab. Comput.25 (2016), 269\u2013299.","journal-title":"Combin. Probab. Comput."},{"key":"3921_CR37","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s11856-017-1546-3","volume":"221","author":"L Warnke","year":"2017","unstructured":"L. Warnke: Upper tails for arithmetic progressions in random subsets, Israel J. Math.221 (2017), 317\u2013365.","journal-title":"Israel J. Math."},{"key":"3921_CR38","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1002\/rsa.20378","volume":"39","author":"G Wolfovitz","year":"2011","unstructured":"G. Wolfovitz: Triangle-free subgraphs in the triangle-free process, Rand. Struct. & Algor.39 (2011), 539\u2013543.","journal-title":"Rand. Struct. & Algor."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3921-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-019-3921-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3921-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T01:00:26Z","timestamp":1722387626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-019-3921-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["3921"],"URL":"https:\/\/doi.org\/10.1007\/s00493-019-3921-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2020,2]]},"assertion":[{"value":"21 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}