A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs

This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an information-theoretic approach, and he also conjectured an upper bound for gen...

Descripción completa

Detalles Bibliográficos
Autor principal: Sason, Igal
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7996360/
https://www.ncbi.nlm.nih.gov/pubmed/33668754
http://dx.doi.org/10.3390/e23030270

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7996360/
https://www.ncbi.nlm.nih.gov/pubmed/33668754
http://dx.doi.org/10.3390/e23030270

Ejemplares similares