Cargando…
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...
Autor principal: | Sason, Igal |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
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 |
Ejemplares similares
-
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory
por: Sason, Igal
Publicado: (2022) -
Divergence Measures: Mathematical Foundations and Applications in Information-Theoretic and Statistical Problems
por: Sason, Igal
Publicado: (2022) -
Some Useful Integral Representations for Information-Theoretic Analyses
por: Merhav, Neri, et al.
Publicado: (2020) -
Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression
por: Sason, Igal
Publicado: (2018) -
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †
por: Sason, Igal
Publicado: (2023)