A conjecture on independent sets and graph covers
Combinatorics
2011-10-18 v3 Discrete Mathematics
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.
Cite
@article{arxiv.1109.2445,
title = {A conjecture on independent sets and graph covers},
author = {Yusuke Watanabe},
journal= {arXiv preprint arXiv:1109.2445},
year = {2011}
}
Comments
This is a technical report; minor corrections are made in v2