{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:38:03Z","timestamp":1773815883827,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1984,3]]},"DOI":"10.1007\/bf02579154","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:16:21Z","timestamp":1174583781000},"page":"35-38","source":"Crossref","is-referenced-by-count":13,"title":["Independence, clique size and maximum degree"],"prefix":"10.1007","volume":"4","author":[{"given":"Siemion","family":"Fajtlowicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579154_CR1","unstructured":"M. Albertson, B. Bollob\u00e1s andS. Tucker, The independence ratio and maximum degree of a graph,Proceedings of 7th SE Conference on Combinatorics, Graph theory and Computing, LSU, (1976), 43\u201350."},{"key":"BF02579154_CR2","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/0095-8956(79)90062-5","volume":"26","author":"P. Catlin","year":"1979","unstructured":"P. Catlin, Haj\u00f3s\u2019 graph-coloring conjecture: variations and counterexamples,Journal of Combinatorial Theory (B) 26 (1979), 268\u2013274.","journal-title":"Journal of Combinatorial Theory (B)"},{"issue":"2","key":"BF02579154_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02579269","volume":"1","author":"P. Erd\u0151s","year":"1981","unstructured":"P. Erd\u0151s andS. Fajtlowicz, On the Conjecture of Haj\u00f3s,Combinatorica 1 (2) (1981), 141\u2013143.","journal-title":"Combinatorica"},{"key":"BF02579154_CR4","unstructured":"S. Fajtlowicz, On the size of independent sets in graphs,Proceedings of the 9th SE Conference on Combinatorics, Graph theory and Computing, Boca Raton (1978), 269\u2013274."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579154.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579154\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:44:58Z","timestamp":1558183498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["BF02579154"],"URL":"https:\/\/doi.org\/10.1007\/bf02579154","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}