Graph covers and the Bethe free energy (BFE) have been useful theoretical tools for producing lower bounds on a variety of counting problems in graphical models, including permanent ferromagnetic Ising model. Here, we investigate weighted homomorphism over bipartite graphs that are related to conjecture Sidorenko. We show BFE does yield bound natural settings, when it bound, necessarily improve...