 Sidorenko conjecture

The Sidorenko conjecture states that every bipartite graph $H$ satisfiesfor every bipartite host graph $G$. Thus a random map is at least as likely to preserve every edge as the heuristic that treats the edge constraints independently predicts.