{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T17:11:40Z","timestamp":1698167500065},"reference-count":2,"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":5697,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1991,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Harary stated the conjecture that for any graph <jats:italic>G<\/jats:italic> with <jats:italic>n<\/jats:italic> edges and without isolated vertices <jats:italic>r<\/jats:italic>(<jats:italic>K<\/jats:italic><jats:sub>3<\/jats:sub>,<jats:italic>G<\/jats:italic>) \u2a7d 2<jats:italic>n<\/jats:italic> + 1. Erd\u00f6s, Faudree, Rousseau, and Schelp proved that <jats:italic>r<\/jats:italic>(<jats:italic>K<\/jats:italic><jats:sub>3<\/jats:sub>,<jats:italic>G<\/jats:italic>) \u2a7d \u23088\/3<jats:italic>n<\/jats:italic>\u2309. Here we prove that <jats:italic>r<\/jats:italic>(<jats:italic>K<\/jats:italic><jats:sub>3<\/jats:sub>,<jats:italic>G<\/jats:italic>) \u2a7d \u230a5\/2<jats:italic>n<\/jats:italic>\u230b \u22121 for <jats:italic>n<\/jats:italic> &gt; 3.<\/jats:p>","DOI":"10.1002\/jgt.3190150104","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T06:50:03Z","timestamp":1181285403000},"page":"15-17","source":"Crossref","is-referenced-by-count":3,"title":["An upper bound on the ramsey number <i>R<\/i>(<i>K<\/i><sub>3<\/sub>, <i>G<\/i>) depending only on the size of the graph <i>G<\/i>"],"prefix":"10.1002","volume":"15","author":[{"given":"A. F.","family":"Sidorenko","sequence":"first","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.1002\/jgt.3190010118"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90173-7"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190150104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190150104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T23:04:41Z","timestamp":1698015881000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190150104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["10.1002\/jgt.3190150104"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190150104","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}