{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:10:15Z","timestamp":1758823815104},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,25]],"date-time":"2010-08-25T00:00:00Z","timestamp":1282694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00373-010-0976-z","type":"journal-article","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T07:40:13Z","timestamp":1282635613000},"page":"177-186","source":"Crossref","is-referenced-by-count":9,"title":["The Number of Independent Sets in a Graph with Small Maximum Degree"],"prefix":"10.1007","volume":"27","author":[{"given":"David","family":"Galvin","sequence":"first","affiliation":[]},{"given":"Yufei","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,25]]},"reference":[{"key":"976_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02772952","volume":"73","author":"N. Alon","year":"1991","unstructured":"Alon N.: Independent sets in regular graphs and sum-free subsets of finite groups. Israel J. Math. 73, 247\u2013256 (1991)","journal-title":"Israel J. Math."},{"key":"976_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S0963548301004631","volume":"10","author":"J. Kahn","year":"2001","unstructured":"Kahn J.: An entropy approach to the hard-core model on bipartite graphs. Combin. Probab. Comput. 10, 219\u2013237 (2001)","journal-title":"Combin. Probab. Comput."},{"key":"976_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/S0963548309990538","volume":"19","author":"Y. Zhao","year":"2010","unstructured":"Zhao Y.: The number of independent sets in a regular graph. Combin. Probab. Comput. 19, 315\u2013320 (2010)","journal-title":"Combin. Probab. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0976-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0976-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0976-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T06:53:03Z","timestamp":1559458383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0976-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,25]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["976"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0976-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,25]]}}}