A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko
states that if H is a bipartite graph, then the random
graph with edge density p has in expectation
asymptotically the minimum number of copies of H over all
graphs of the same order and...
