{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:39:05Z","timestamp":1762033145720},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T00:00:00Z","timestamp":1379289600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p>We consider numbers and sizes of independent sets in graphs with minimum degree at least<jats:italic>d<\/jats:italic>. In particular, we investigate which of these graphs yield the maximum numbers of independent sets of different sizes, and which yield the largest random independent sets. We establish a strengthened form of a conjecture of Galvin concerning the first of these topics.<\/jats:p>","DOI":"10.1017\/s0963548313000369","type":"journal-article","created":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T13:35:52Z","timestamp":1379338552000},"page":"874-884","source":"Crossref","is-referenced-by-count":5,"title":["On Independent Sets in Graphs with Given Minimum Degree"],"prefix":"10.1017","volume":"22","author":[{"given":"HIU-FAI","family":"LAW","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"COLIN","family":"McDIARMID","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"S0963548313000369_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.12.008"},{"key":"S0963548313000369_ref1","doi-asserted-by":"crossref","first-page":"#37","DOI":"10.37236\/2722","article-title":"Independent sets in graphs with given minimum degree","volume":"19","author":"Alexander","year":"2012","journal-title":"Electron. J. Combin."},{"key":"S0963548313000369_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990538"},{"key":"S0963548313000369_ref6","first-page":"97","article-title":"Generalizations of the matching polynomial.","volume":"24","author":"Gutman","year":"1983","journal-title":"Utilitas Math."},{"key":"S0963548313000369_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.09.007"},{"key":"S0963548313000369_ref10","first-page":"16","article-title":"Fibonacci numbers of graphs.","volume":"20","author":"Prodinger","year":"1982","journal-title":"Fibonacci Quart."},{"key":"S0963548313000369_ref4","article-title":"Counting independent sets of a fixed size in graphs with a minimum degree","author":"Engbers","year":"2013","journal-title":"J. Graph Theory"},{"key":"S0963548313000369_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-004-2055-4"},{"key":"S0963548313000369_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301004631"},{"key":"S0963548313000369_ref3","doi-asserted-by":"crossref","first-page":"#169","DOI":"10.37236\/656","article-title":"Extremal problems for independent set enumeration","volume":"18","author":"Cutler","year":"2011","journal-title":"Electron. J. Combin."},{"key":"S0963548313000369_ref8","first-page":"199","article-title":"Trees and forests with large and small independent indices.","volume":"23","author":"Lin","year":"1995","journal-title":"Chinese J. Math."},{"key":"S0963548313000369_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.06.015"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548313000369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T03:39:51Z","timestamp":1596512391000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548313000369\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,16]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["S0963548313000369"],"URL":"https:\/\/doi.org\/10.1017\/s0963548313000369","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,16]]}}}