{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T15:10:06Z","timestamp":1698333006056},"reference-count":5,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":6305,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,7]]},"abstract":"Abstract<\/jats:title>The irredundant Ramsey number s<\/jats:italic>(m, n<\/jats:italic>) is the least value of p<\/jats:italic> such that for any p<\/jats:italic>\u2010vertex graph G<\/jats:italic>, either G<\/jats:italic> has an irredundant set of at least n<\/jats:italic> vertices or its complement G<\/jats:italic> has an irredundant set of at least m<\/jats:italic> vertices. The existence of these numbers is guaranteed by Ramsey's theorem. We prove that s<\/jats:italic>(3, 3) = 6, s<\/jats:italic>(3, 4) = 8, and s<\/jats:italic>(3,5) = 12.<\/jats:p>","DOI":"10.1002\/jgt.3190130303","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:27:06Z","timestamp":1180182426000},"page":"283-290","source":"Crossref","is-referenced-by-count":14,"title":["Irredundant ramsey numbers for graphs"],"prefix":"10.1002","volume":"13","author":[{"given":"R. C.","family":"Brewster","sequence":"first","affiliation":[]},{"given":"E. J.","family":"Cockayne","sequence":"additional","affiliation":[]},{"given":"C. M.","family":"Mynhardt","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Theory of Graphs and Its Applications","author":"Berge C.","year":"1962"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1978-079-5"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(82)90055-7"},{"key":"e_1_2_1_5_2","unstructured":"S. T.HedetniemiandR.Laskar Bibliography concerning domination independence and irredundance in graphs. Internal Research Report Department of Computer Science Clemson University Clemson SC."},{"key":"e_1_2_1_6_2","volume-title":"Selected Topics in Graph Theory","author":"Parsons T. D.","year":"1978"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190130303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T13:28:06Z","timestamp":1697981286000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["10.1002\/jgt.3190130303"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130303","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}