A conjecture on independent sets and graph covers
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.