Introduction and main results
(1.1) Graph homomorphism partition function
(1.1.2) Colorings
(1.1.3) Independent sets
(1.1.4) Maximum cut
(1.2) Partition function of edge-colored graph homomorphisms
(1.3) Our results
(1.4) The idea of the algorithm
The algorithm
(2.1) The algorithm for approximating the partition function
(2.2) Proof of Lemma 1.5
Proof of Theorem 1.6
(3.1) Recursion
(3.5) Proof of Theorem 1.6
Acknowledgment
References