{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913673,"version":"3.41.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2218374"],"award-info":[{"award-number":["2218374"]}],"id":[{"id":"10.13039\/100000121","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":[[2025,2]]},"DOI":"10.1007\/s00373-025-02896-8","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T10:57:25Z","timestamp":1737543445000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$${\\mathcal {R}}(K_6-e,K_4) =30 ^*$$"],"prefix":"10.1007","volume":"41","author":[{"given":"David","family":"James","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3622-7955","authenticated-orcid":false,"given":"Elisha","family":"Kahan","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Rauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"2896_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/jgt.22235","volume":"89","author":"V Angeltveit","year":"2018","unstructured":"Angeltveit, V., McKay, B.D.: $$R(5,5) \\le 48$$. J. Graph Theory 89, 5\u201313 (2018)","journal-title":"J. Graph Theory"},{"key":"2896_CR2","unstructured":"Boza, L.: Sobre el N\u00famero de Ramsey $$R(K_4, K_6-e)$$. VIII Encuentro Andaluz de Matem\u00e1tica Discreta Sevilla, Spain (2013)"},{"key":"2896_CR3","unstructured":"Boza, L.: Sobre los n\u00fameros de Ramsey $$R(K_5-e, K_5)$$ y $$R(K_6- e, K_4)$$. IX Jornadas de Matem\u00e1tica Discreta Algor\u00edtmica, pp. 145\u2013152 (2014)"},{"key":"2896_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"2896_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.2140\/pjm.1972.41.335","volume":"41","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Harary, F.: Generalized Ramsey theory for graphs, III, small off-diagonal numbers. Pacific J. Math. 41, 335\u2013345 (1972)","journal-title":"Pacific J. Math."},{"key":"2896_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/jgt.3190010117","volume":"1","author":"M Clancy","year":"1977","unstructured":"Clancy, M.: Some small Ramsey numbers. J. Graph Theory 1, 89\u201391 (1977)","journal-title":"J. Graph Theory"},{"key":"2896_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/jgt.3190130113","volume":"13","author":"G Exoo","year":"1989","unstructured":"Exoo, G.: A lower bound for $$R(5,5)$$. J. Graph Theory 13, 97\u201398 (1989)","journal-title":"J. Graph Theory"},{"key":"2896_CR8","first-page":"277","volume":"25","author":"G Exoo","year":"1988","unstructured":"Exoo, G., Harborth, H., Mengersen, I.: The Ramsey number of $$K_4$$ versus $$K_5-e$$. Ars Combinatoria 25, 277\u2013286 (1988)","journal-title":"Ars Combinatoria"},{"key":"2896_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/jgt.3190040307","volume":"4","author":"J Faudree","year":"1980","unstructured":"Faudree, J., Rousseau, C.C., Schelp, R.H.: All triangle-graph Ramsey numbers for connected graphs of order six. J. Graph Theory 4, 293\u2013300 (1980)","journal-title":"J. Graph Theory"},{"key":"2896_CR10","unstructured":"Fidytek,R.: Dataset of non-isomorphic graphs of the coloring types $$(K_3,K_m-e;n)$$, $$2{<}m{<}7$$, $$1{<}n{<}R(K_3,K_m-e)$$. https:\/\/mostwiedzy.pl\/en\/open-research-data\/dataset-of-non-isomorphic-graphs-of-the-coloring-types-k3-km-e-n-2-m-7-1-n-r-k3-km-e,701013533733321-0"},{"key":"2896_CR11","unstructured":"Fidytek, R.: Dataset of non-isomorphic graphs of the coloring types $$(K_4,K_m-e;n)$$, $$2<m<5$$, $$1<n<R(K_4,K_m-e)$$, https:\/\/mostwiedzy.pl\/en\/open-research-data\/dataset-of-non-isomorphic-graphs-of-the-coloring-types-k4-km-e-n-2-m-5-1-n-r-k4-km-e,707013532732354-0"},{"key":"2896_CR12","unstructured":"Fidytek, R.: Ramsey graphs $$R(K_n,K_m-e)$$, http:\/\/fidytek.inf.ug.edu.pl\/ramsey, (2010). No longer available"},{"key":"2896_CR13","doi-asserted-by":"publisher","first-page":"2328","DOI":"10.1137\/18M1169473","volume":"35","author":"B Lidicky","year":"2021","unstructured":"Lidicky, B., Pfender, F.: Semidefinite programming and Ramsey numbers. SIAM J. Discrete Math. 35, 2328\u20132344 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"2896_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190190304","volume":"19","author":"BD McKay","year":"1995","unstructured":"McKay, B.D., Radziszowski, S.P.: $$R(4,5)=25$$. J. Graph Theory 19, 309\u2013322 (1995)","journal-title":"J. Graph Theory"},{"key":"2896_CR15","doi-asserted-by":"crossref","unstructured":"Radziszowski, S.: Small Ramsey numbers, The electronic journal of combinatorics1000, (2011)","DOI":"10.37236\/21"},{"key":"2896_CR16","unstructured":"Zhao, W.: Encoding lexicographical ordering constraints in SAT (2017)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02896-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02896-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02896-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:42Z","timestamp":1748319762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02896-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2896"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02896-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"11 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"27"}}