  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.
