Wird geladen...
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...
Gespeichert in:
| Veröffentlicht in: | Entropy (Basel) |
|---|---|
| 1. Verfasser: | |
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
MDPI
2021
|
| Schlagworte: | |
| Online Zugang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7996360/ https://ncbi.nlm.nih.gov/pubmed/33668754 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e23030270 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|