The conjectured inequality can be interpreted as a statement that the density of copies of formula_1 in a graph is asymptotically minimized by a random graph, as one would expect a formula_9 fraction of possible subgraphs to be a copy of formula_1 if each edge exists with probability formula_11.