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

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...

Full description

Bibliographic Details
Main Author: Igal Sason
Format: Article
Language:English
Published: MDPI AG 2021-02-01
Series:Entropy
Subjects:
Shannon entropy
Shearer’s lemma
counting
independent sets
graphs.
Online Access:https://www.mdpi.com/1099-4300/23/3/270

Similar Items

Similar Items