%0 Journal Article
%T On the logarithimic calculus and Sidorenko's conjecture
%A J. L. Xiang Li
%A Balazs Szegedy
%J Mathematics
%D 2011
%I arXiv
%X We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration of the method we verify the conjecture of Erd\"os-Simonovits and Sidorenko for new families of graphs. In particular we give a short analytic proof for a result by Conlon, Fox and Sudakov. Using this, we prove the forcing conjecture for bipartite graphs in which one vertex is complete to the other side.
%U http://arxiv.org/abs/1107.1153v1