{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:02Z","timestamp":1760245022668},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5331,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Ramsey number <jats:italic>R<\/jats:italic>(3, 8) can be defined as the least number <jats:italic>n<\/jats:italic> such that every graph on <jats:italic>n<\/jats:italic> vertices contains either a triangle or an independent set of size 8. With the help of a substantial amount of computation, we prove that <jats:italic>R<\/jats:italic>(3, 8)=28.<\/jats:p>","DOI":"10.1002\/jgt.3190160111","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T01:18:01Z","timestamp":1181265481000},"page":"99-105","source":"Crossref","is-referenced-by-count":17,"title":["The value of the Ramsey number <i>r<\/i>(3, 8)"],"prefix":"10.1002","volume":"16","author":[{"given":"Brendan D.","family":"McKay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang Ke","family":"Min","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0402043"},{"key":"e_1_2_1_3_2","unstructured":"G.Exoo A lower bound forR(3 12). preprint (1990)."},{"key":"e_1_2_1_4_2","volume-title":"Ramsey Theory","author":"Graham R. L.","year":"1980"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90055-7"},{"key":"e_1_2_1_6_2","unstructured":"B. D.McKay NautyUser's Guide. Technical Report TR\u2010CS\u201090\u201002 Computer Science Deparment Australian National University (1990)."},{"key":"e_1_2_1_7_2","first-page":"37","article-title":"On R(3, k) Ramsey graphs: Theoretical and computational results","volume":"4","author":"Raziszowski S.","year":"1988","journal-title":"J. Combinat. Math. Combinat. Comput."},{"key":"e_1_2_1_8_2","first-page":"207","article-title":"Upper bounds for some Ramsey numbers R(3, k","volume":"4","author":"Radziszowski S.","year":"1988","journal-title":"J. Combinat. Math. Combinat. Comput."},{"key":"e_1_2_1_9_2","first-page":"117","article-title":"New lower bounds for the Ramsey numbers R(3, q) [Chinese]","volume":"25","author":"Qing\u2010zian Wang","year":"1989","journal-title":"Beijing Daxue Xuebao"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190160111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190160111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:20:56Z","timestamp":1698070856000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190160111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1002\/jgt.3190160111"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190160111","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}