{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:33:36Z","timestamp":1778715216466,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11124,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1983,2]]},"DOI":"10.1016\/0095-8956(83)90003-5","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"22-39","source":"Crossref","is-referenced-by-count":62,"title":["Lower bounds on the independence number in terms of the degrees"],"prefix":"10.1016","volume":"34","author":[{"given":"Jerrold R","family":"Griggs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(83)90003-5_BIB1","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","article-title":"A note on Ramsey numbers","volume":"29","author":"Ajtai","year":"1980","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0095-8956(83)90003-5_BIB2","series-title":"Proc. 7th Southeastern Conf. on Combinatorics, Graph Theory, and Computing","first-page":"43","article-title":"The independence ratio and maximum degree of a graph","author":"Albertson","year":"1976"},{"key":"10.1016\/0095-8956(83)90003-5_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190020102","article-title":"On the independence ratio of a graph","volume":"2","author":"Albertson","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(83)90003-5_BIB4","author":"Berge","year":"1970"},{"key":"10.1016\/0095-8956(83)90003-5_BIB5","author":"Bertram","year":"1981","journal-title":"Some Applications of Graph Theory to Finite Groups"},{"key":"10.1016\/0095-8956(83)90003-5_BIB6","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0095-8956(83)90003-5_BIB7","unstructured":"Y. Caro, unpublished, Tel-Aviv, ca. 1980; communicated by N. Linial."},{"key":"10.1016\/0095-8956(83)90003-5_BIB8_1","series-title":"Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory, and Computing","first-page":"273","article-title":"The independence ratio for cubic graphs","author":"Fajtlowicz","year":"1977"},{"issue":"No. 10560","key":"10.1016\/0095-8956(83)90003-5_BIB8_2","article-title":"The independence ratio for cubic graphs","volume":"58","author":"Fajtlowicz","year":"1979","journal-title":"Math Rev."},{"key":"10.1016\/0095-8956(83)90003-5_BIB9_1","series-title":"Proc. 9th Southeastern Conf. on Combinatorics, Graph Theory, and Computing","first-page":"269","article-title":"On the size of independent sets in graphs","author":"Fajtlowicz","year":"1978"},{"issue":"No. 05089","key":"10.1016\/0095-8956(83)90003-5_BIB9_2","article-title":"On the size of independent sets in graphs","volume":"80j","author":"Fajtlowicz","year":"1980","journal-title":"Math. Rev."},{"key":"10.1016\/0095-8956(83)90003-5_BIB10","author":"Garey","year":"1979"},{"issue":"No. 10305","key":"10.1016\/0095-8956(83)90003-5_BIB11","volume":"55","author":"Hutchinson","year":"1978","journal-title":"Math. Rev."},{"key":"10.1016\/0095-8956(83)90003-5_BIB12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0095-8956(83)90003-5_BIB13","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1090\/S0002-9947-1979-0546922-6","article-title":"Some Ramsey-type numbers and the independence ratio","volume":"256","author":"Staton","year":"1979","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0095-8956(83)90003-5_BIB14","article-title":"Coding for a Multiple Access Channel","author":"Wei","year":"1980"},{"key":"10.1016\/0095-8956(83)90003-5_BIB15","author":"Wei","year":"1981","journal-title":"A Lower Bound on the Stability Number of a Simple Graph"},{"key":"10.1016\/0095-8956(83)90003-5_BIB16","doi-asserted-by":"crossref","unstructured":"J. R. Griggs, An upper bound on the Ramsey numbers R(3,k), J. Combin. Theory Ser. A, to appear.","DOI":"10.1016\/0097-3165(83)90003-1"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895683900035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895683900035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T16:22:01Z","timestamp":1548778921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895683900035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["0095895683900035"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(83)90003-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}