Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. The number of independent sets in an irregular graph

The number of independent sets in an irregular graph

Thumbnail Image
Download
Name

1805.04021.pdf

Description
Accepted version
Size

573.62 KB

Format

Adobe PDF

Checksum (MD5)

fe687e864ce449355637cba091e205bb

sword-2019-11-24T15:54:40.original.xml (130 B)
Original SWORD entry document
Author(s)
Sah, Ashwin
•
Sawhney, Mehtaab
•
Zhao, Yufei
Date Issued
September 2019
Journal
Journal of combinatorial theory. Series B
Publisher
Elsevier BV
Citation
Sah, Ashwin et al. “The number of independent sets in an irregular graph.” Journal of combinatorial theory. Series B, vol. 138, 2019, pp. 172-195 © 2019 The Author(s)
Version
Author's final manuscript
Abstract
Settling Kahn's conjecture (2001), we prove the following upper bound on the number i(G) of independent sets in a graph G without isolated vertices: i(G)≤∏uv∈E(G)i(Kdu,dv)1/(dudv), where du is the degree of vertex u in G. Equality occurs when G is a disjoint union of complete bipartite graphs. The inequality was previously proved for regular graphs by Kahn and Zhao. We also prove an analogous tight lower bound: i(G)≥∏v∈V(G)i(Kdv+1)1/(dv+1), where equality occurs for G a disjoint union of cliques. More generally, we prove bounds on the weighted versions of these quantities, i.e., the independent set polynomial, or equivalently the partition function of the hard-core model with a given fugacity on a graph.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/126178
DOI of Published Version
https://doi.org/10.1016/J.JCTB.2019.01.007
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.