{"id":"https://openalex.org/W2164181738","doi":"https://doi.org/10.1017/s0963548309990538","title":"The Number of Independent Sets in a Regular Graph","display_name":"The Number of Independent Sets in a Regular Graph","publication_year":2009,"publication_date":"2009-11-13","ids":{"openalex":"https://openalex.org/W2164181738","doi":"https://doi.org/10.1017/s0963548309990538","mag":"2164181738"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548309990538","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548309990538","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2D8AF5BAB26AF1763A3EC8771D721DAF/S0963548309990538a.pdf/div-class-title-the-number-of-independent-sets-in-a-regular-graph-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2D8AF5BAB26AF1763A3EC8771D721DAF/S0963548309990538a.pdf/div-class-title-the-number-of-independent-sets-in-a-regular-graph-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"YUFEI ZHAO","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"YUFEI ZHAO","raw_affiliation_strings":["Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (e-mail:","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":4.2608,"has_fulltext":true,"cited_by_count":76,"citation_normalized_percentile":{"value":0.94609537,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"19","issue":"2","first_page":"315","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.7886999845504761,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.7886999845504761,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.06790000200271606,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.03920000046491623,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6319000124931335},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5314000248908997},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5246999859809875},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4959000051021576},{"id":"https://openalex.org/keywords/edge-transitive-graph","display_name":"Edge-transitive graph","score":0.48739999532699585},{"id":"https://openalex.org/keywords/independence-number","display_name":"Independence number","score":0.44830000400543213},{"id":"https://openalex.org/keywords/foster-graph","display_name":"Foster graph","score":0.4399000108242035},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41780000925064087},{"id":"https://openalex.org/keywords/distance-regular-graph","display_name":"Distance-regular graph","score":0.39559999108314514},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.38940000534057617}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.850600004196167},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8144000172615051},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6319000124931335},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6161999702453613},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5314000248908997},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5246999859809875},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4959000051021576},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.48739999532699585},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.44830000400543213},{"id":"https://openalex.org/C68996132","wikidata":"https://www.wikidata.org/wiki/Q3115485","display_name":"Foster graph","level":5,"score":0.4399000108242035},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41780000925064087},{"id":"https://openalex.org/C56783289","wikidata":"https://www.wikidata.org/wiki/Q3115556","display_name":"Distance-regular graph","level":5,"score":0.39559999108314514},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.38940000534057617},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.38370001316070557},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.33079999685287476},{"id":"https://openalex.org/C133875400","wikidata":"https://www.wikidata.org/wiki/Q692823","display_name":"Strongly regular graph","level":5,"score":0.30570000410079956},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.3009999990463257},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C114727528","wikidata":"https://www.wikidata.org/wiki/Q7840044","display_name":"Triangle-free graph","level":5,"score":0.2922999858856201},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.28929999470710754},{"id":"https://openalex.org/C28093856","wikidata":"https://www.wikidata.org/wiki/Q835614","display_name":"Petersen graph","level":5,"score":0.28700000047683716},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.2838999927043915},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2750000059604645},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2637999951839447},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548309990538","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548309990538","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2D8AF5BAB26AF1763A3EC8771D721DAF/S0963548309990538a.pdf/div-class-title-the-number-of-independent-sets-in-a-regular-graph-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0909.3354","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0909.3354","pdf_url":"https://arxiv.org/pdf/0909.3354","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0963548309990538","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548309990538","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2D8AF5BAB26AF1763A3EC8771D721DAF/S0963548309990538a.pdf/div-class-title-the-number-of-independent-sets-in-a-regular-graph-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G264516904","display_name":null,"funder_award_id":"H98230-06-1-001","funder_id":"https://openalex.org/F4320311089","funder_display_name":"National Security Agency"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6986451848","display_name":null,"funder_award_id":"DMS 0754106","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7587565994","display_name":"REU Site: An undergraduate research program in Discrete Mathematics","funder_award_id":"0754106","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7767944625","display_name":null,"funder_award_id":"H98230-06-1-0013","funder_id":"https://openalex.org/F4320311089","funder_display_name":"National Security Agency"},{"id":"https://openalex.org/G7845798442","display_name":null,"funder_award_id":"H98230","funder_id":"https://openalex.org/F4320311089","funder_display_name":"National Security Agency"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309636","display_name":"University of Minnesota","ror":"https://ror.org/03grvy078"},{"id":"https://openalex.org/F4320311089","display_name":"National Security Agency","ror":"https://ror.org/0047bvr32"},{"id":"https://openalex.org/F4320311500","display_name":"University of Minnesota Duluth","ror":"https://ror.org/01hy4qx27"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2164181738.pdf","grobid_xml":"https://content.openalex.org/works/W2164181738.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W45561327","https://openalex.org/W1834605046","https://openalex.org/W1986646471","https://openalex.org/W2046106340","https://openalex.org/W2072678675","https://openalex.org/W2078000356","https://openalex.org/W2083618772","https://openalex.org/W2145092624","https://openalex.org/W2963574247","https://openalex.org/W6653418691"],"related_works":[],"abstract_inverted_index":{"We":[0,66],"show":[1],"that":[2,71],"the":[3,28,56,59,73,77,94],"number":[4],"of":[5,36,46,97],"independent":[6],"sets":[7],"in":[8,48,52],"an":[9,90],"N":[10,23],"-vertex,":[11],"d":[12,19,25,38],"-regular":[13,39],"graph":[14,60],"is":[15,30,61],"at":[16],"most":[17],"(2":[18],"+1":[20],"\u2212":[21],"1)":[22],"/2":[24],",":[26,89],"where":[27],"bound":[29,57,92],"sharp":[31],"for":[32,84,93],"a":[33,44,68,85,98],"disjoint":[34],"union":[35],"complete":[37],"bipartite":[40,78],"graphs.":[41],"This":[42],"settles":[43],"conjecture":[45],"Alon":[47],"1991":[49],"and":[50],"Kahn":[51,54],"2001.":[53],"proved":[55],"when":[58],"assumed":[62],"to":[63,76],"be":[64],"bipartite.":[65],"give":[67],"short":[69],"proof":[70],"reduces":[72],"general":[74],"case":[75],"case.":[79],"Our":[80],"method":[81],"also":[82],"works":[83],"weighted":[86],"generalization,":[87],"i.e.":[88],"upper":[91],"independence":[95],"polynomial":[96],"regular":[99],"graph.":[100]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}