{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T14:41:28Z","timestamp":1698331288020},"reference-count":2,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4296,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The graph <jats:italic>K<\/jats:italic><jats:sub>5<\/jats:sub> \u2010 <jats:italic>e<\/jats:italic> is obtained from the complete graph <jats:italic>K<\/jats:italic><jats:sub>5<\/jats:sub> by deleting one edge, while <jats:italic>K<\/jats:italic><jats:sub>1<\/jats:sub> + <jats:italic>C<\/jats:italic><jats:sub>4<\/jats:sub> is obtained from <jats:italic>K<\/jats:italic><jats:sub>5<\/jats:sub> by deleting two independent edges. With the help of a computer it is shown that <jats:italic>r<\/jats:italic>(<jats:italic>K<\/jats:italic><jats:sub>1<\/jats:sub> + <jats:italic>C<\/jats:italic><jats:sub>4<\/jats:sub>, <jats:italic>K<\/jats:italic><jats:sub>5<\/jats:sub> \u2010 <jats:italic>e<\/jats:italic>) = 17. \u00a9 1995 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190190103","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T16:21:09Z","timestamp":1181233269000},"page":"13-15","source":"Crossref","is-referenced-by-count":2,"title":["The ramsey number <i>r<\/i>(<i>k<\/i><sub>1<\/sub> + <i>c<\/i><sub>4<\/sub>, <i>k<\/i><sub>5<\/sub> \u2212 <i>e<\/i>)"],"prefix":"10.1002","volume":"19","author":[{"given":"Yang","family":"Yuansheng","sequence":"first","affiliation":[]},{"given":"G. R. T.","family":"Hendry","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130210"},{"key":"e_1_2_1_3_2","first-page":"204","article-title":"On extremal graphs without 4\u2010cycles","volume":"41","author":"Yuansheng Yang","year":"1992","journal-title":"Util. Math."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190190103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190190103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T01:56:54Z","timestamp":1698285414000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190190103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1002\/jgt.3190190103"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190190103","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}