A conjecture on independent sets and graph covers
arXiv:1109.2445
Abstract
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.
This is a technical report; minor corrections are made in v2