{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T05:40:15Z","timestamp":1698385215450},"reference-count":4,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4237,"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,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The irredundant Ramsey number <jats:italic>s<\/jats:italic>(<jats:italic>m, n<\/jats:italic>) is the smallest <jats:italic>p<\/jats:italic> such that for every graph <jats:italic>G<\/jats:italic> with <jats:italic>p<\/jats:italic> vertices, either <jats:italic>G<\/jats:italic> contains an <jats:italic>n<\/jats:italic>\u2010element irredundant set or its complement <jats:italic>G<\/jats:italic> contains an <jats:italic>m<\/jats:italic>\u2010element irredundant set. Cockayne, Hattingh, and Mynhardt have given a computer\u2010assisted proof that <jats:italic>s<\/jats:italic>(3, 7) = 18. The purpose of this paper is to give a self\u2010contained proof of this result. \u00a9 1995 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190190211","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T13:56:43Z","timestamp":1180187803000},"page":"263-270","source":"Crossref","is-referenced-by-count":4,"title":["The irredundant ramsey number <i>s<\/i>(3, 7)"],"prefix":"10.1002","volume":"19","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Cecil C.","family":"Rousseau","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.3190130303"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1080\/16073606.1990.9631608"},{"key":"e_1_2_1_4_2","first-page":"145","article-title":"The irredundant Ramsey number s(3, 7)","volume":"39","author":"Cockayne E. J.","year":"1991","journal-title":"Utilitas Math."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140407"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190190211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190190211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T14:17:59Z","timestamp":1698329879000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190190211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["10.1002\/jgt.3190190211"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190190211","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,3]]}}}