An upper bound for the number of independent sets in regular graphs
暂无分享,去创建一个
[1] A. A. Sapozhenko. The number of independent sets in graphs , 2007 .
[2] Jeff Kahn,et al. An Entropy Approach to the Hard-Core Model on Bipartite Graphs , 2001, Combinatorics, Probability and Computing.
[3] N. Alon. Independent sets in regular graphs and sum-free subsets of finite groups , 1991 .
[4] V. E. Alekseev. An upper bound for the number of maximal independent sets in a graph , 2007 .
[5] Александр Антонович Сапоженко,et al. О числе независимых множеств в расширителях@@@On the number of independent sets in extenders , 2001 .
[6] Mokshay M. Madiman,et al. Information Inequalities for Joint Distributions, With Interpretations and Applications , 2008, IEEE Transactions on Information Theory.
[7] A. A. SAPOZHENKO. On the number of independent sets in expanders , 2001 .
[8] Prasad Tetali,et al. On Weighted Graph Homomorphisms , 2001, Graphs, Morphisms and Statistical Physics.
[9] Prasad Tetali,et al. Matchings and independent sets of a fixed size in regular graphs , 2009, J. Comb. Theory, Ser. A.