{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:58Z","timestamp":1740107098937,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T00:00:00Z","timestamp":1612224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T00:00:00Z","timestamp":1612224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61572005"],"award-info":[{"award-number":["61572005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11361008"],"award-info":[{"award-number":["11361008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00373-020-02262-w","type":"journal-article","created":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T05:09:48Z","timestamp":1612242588000},"page":"651-661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Ramsey Numbers $$R(K_4-e, K_t)$$"],"prefix":"10.1007","volume":"37","author":[{"given":"Yu","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7839-1174","authenticated-orcid":false,"given":"Meilian","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongqi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,2]]},"reference":[{"key":"2262_CR1","doi-asserted-by":"crossref","unstructured":"Bohman, T., Keevash, P.: Dynamic concentration of the triangle-free process. In: The Seventh European Conference on Combinatorics, Graph Theory and Applications, pp. 489\u2013495. Springer (2013)","DOI":"10.1007\/978-88-7642-475-5_78"},{"key":"2262_CR2","first-page":"115","volume":"35","author":"SA Burr","year":"1989","unstructured":"Burr, S.A., Erdos, P., Faudree, R.J., Schelp, R.: On the difference between consecutive Ramsey numbers. Util. Math. 35, 115\u2013118 (1989)","journal-title":"Util. Math."},{"issue":"5","key":"2262_CR3","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/j.jctb.2012.06.001","volume":"102","author":"A Gy\u00e1rf\u00e1s","year":"2012","unstructured":"Gy\u00e1rf\u00e1s, A., Seb\u0151, A., Trotignon, N.: The chromatic gap and its extremes. J. Comb. Theory Ser. B 102(5), 1155\u20131178 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"8","key":"2262_CR4","doi-asserted-by":"publisher","first-page":"955","DOI":"10.3390\/sym11080955","volume":"11","author":"Y Jiang","year":"2019","unstructured":"Jiang, Y., Liang, M., Teng, Y., Xu, X.: The cyclic triangle-free process. Symmetry 11(8), 955 (2019)","journal-title":"Symmetry"},{"key":"2262_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2019.07.006","volume":"267","author":"M Liang","year":"2019","unstructured":"Liang, M., Radziszowski, S.P., Xu, X.: On a diagonal conjecture for classical Ramsey numbers. Discrete Appl. Math. 267, 195\u2013200 (2019)","journal-title":"Discrete Appl. Math."},{"key":"2262_CR6","unstructured":"Lidick\u1ef3, B., Pfender, F.: Semidefinite programming and Ramsey numbers. arXiv preprint arXiv:1704.03592 (2017)"},{"key":"2262_CR7","unstructured":"Pontiveros, G.F., Griffiths, S., Morris, R.: The triangle-free process and R(3, k). arXiv preprint arXiv:1302.6279118 (2013)"},{"key":"2262_CR8","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/1274","volume-title":"The Triangle-Free Process and the Ramsey Number R(3, k)","author":"GF Pontiveros","year":"2020","unstructured":"Pontiveros, G.F., Griffiths, S., Morris, R.: The Triangle-Free Process and the Ramsey Number R(3, k). American Mathematical Society, Washington, DC (2020)"},{"key":"2262_CR9","unstructured":"Radziszowski, S.P.: Small Ramsey numbers. In: The Electronic Journal of Combinatorics pp. DS1\u2013Mar (2017)"},{"issue":"1","key":"2262_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0012-365X(83)90273-X","volume":"46","author":"JB Shearer","year":"1983","unstructured":"Shearer, J.B.: A note on the independence number of triangle-free graphs. Discrete Math. 46(1), 83\u201387 (1983)","journal-title":"Discrete Math."},{"issue":"3","key":"2262_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/jgt.20038","volume":"47","author":"X Xiaodong","year":"2004","unstructured":"Xiaodong, X., Zheng, X., Radziszowski, S.P.: A constructive approach for the lower bounds on the Ramsey numbers R(s, t). J. Graph Theory 47(3), 231\u2013239 (2004)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2262_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1137\/10080868X","volume":"25","author":"X Xu","year":"2011","unstructured":"Xu, X., Shao, Z., Radziszowski, S.P.: More constructive lower bounds on classical Ramsey numbers. SIAM J. Discrete Math. 25(1), 394\u2013400 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"2262_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.dam.2016.06.003","volume":"214","author":"R Zhu","year":"2016","unstructured":"Zhu, R., Xu, X., Radziszowski, S.P.: A small step forwards on the Erd\u0151s\u2013S\u00f3s problem concerning the Ramsey numbers R(3, k). Discrete Appl. Math. 214, 216\u2013221 (2016)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02262-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02262-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02262-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T14:37:17Z","timestamp":1619447837000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02262-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,2]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["2262"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02262-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,2,2]]},"assertion":[{"value":"18 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}