{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T18:39:21Z","timestamp":1700159961743},"reference-count":6,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9620,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1980,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A formula is presented for the ramsey number of any forest of order at least 3 versus any graph <jats:italic>G<\/jats:italic> of order <jats:italic>n<\/jats:italic> \u2265 4 having clique number <jats:italic>n<\/jats:italic> \u2010 1. In particular, if <jats:italic>T<\/jats:italic> is a tree of order <jats:italic>m<\/jats:italic> \u2265 3, then <jats:italic>r(T, G)<\/jats:italic> = 1 + (<jats:italic>m<\/jats:italic> \u2010 1)(<jats:italic>n<\/jats:italic> \u2010 2).<\/jats:p>","DOI":"10.1002\/jgt.3190040211","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:26:00Z","timestamp":1180419960000},"page":"233-239","source":"Crossref","is-referenced-by-count":2,"title":["On ramsey numbers of forests versus nearly complete graphs"],"prefix":"10.1002","volume":"4","author":[{"given":"Gary","family":"Chartrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald J.","family":"Gould","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert D.","family":"Polimeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066435"},{"key":"e_1_2_1_3_2","first-page":"215","article-title":"On the magnitude of generalized Ramsey numbers for graphs. Infinite and Finite Sets","volume":"10","author":"Burr S. A.","year":"1975","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010118"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.41.335"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-18.3.392"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1975-069-0"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190040211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190040211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:20:50Z","timestamp":1699777250000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190040211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["10.1002\/jgt.3190040211"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190040211","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}