Nalaganje...

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

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
izdano v:Entropy (Basel)
Glavni avtor: Sason, Igal
Format: Artigo
Jezik:Inglês
Izdano: MDPI 2021
Teme:
Online dostop: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
Oznake: Označite
Brez oznak, prvi označite!