arXiv Analytics

Sign in

arXiv:1109.2445 [math.CO]AbstractReferencesReviewsResources

A conjecture on independent sets and graph covers

Yusuke Watanabe

Published 2011-09-12, updated 2011-10-17Version 3

In this article, I present a conjecture on the number of independent sets on graph covers. I also show that the conjecture implies that the partition function of a binary pairwise attractive model is greater than that of the Bethe approximation.

Comments: This is a technical report; minor corrections are made in v2
Categories: math.CO, cs.DM
Related articles: Most relevant | Search more
arXiv:2004.03060 [math.CO] (Published 2020-04-07)
Independent sets in middle two layers of Boolean lattice
arXiv:1907.03913 [math.CO] (Published 2019-07-09)
Independent Sets in n-vertex k-chromatic, \ell-connected graphs
arXiv:0810.0866 [math.CO] (Published 2008-10-06, updated 2012-09-16)
The enumeration of independent sets on some lattices

Links

Toolbox